/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-RepeatedSemanticLbeWithPredicates.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 05:15:49,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:15:49,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:15:49,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:15:49,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:15:49,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:15:49,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:15:49,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:15:49,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:15:49,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:15:49,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:15:49,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:15:49,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:15:49,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:15:49,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:15:49,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:15:49,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:15:49,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:15:49,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:15:49,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:15:49,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:15:49,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:15:49,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:15:49,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:15:49,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:15:49,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:15:49,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:15:49,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:15:49,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:15:49,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:15:49,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:15:49,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:15:49,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:15:49,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:15:49,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:15:49,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:15:49,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:15:49,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:15:49,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:15:49,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:15:49,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:15:49,866 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:15:49,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:15:49,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:15:49,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:15:49,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:15:49,901 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:15:49,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:15:49,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:15:49,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:15:49,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:15:49,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:15:49,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:15:49,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:15:49,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:15:49,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:15:49,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:15:49,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:15:49,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:15:49,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:15:49,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:15:49,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:15:49,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:15:49,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:15:49,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:15:49,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:15:49,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:15:49,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:15:49,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:15:49,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:15:49,906 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 05:15:50,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:15:50,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:15:50,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:15:50,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:15:50,223 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:15:50,224 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 05:15:51,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:15:51,506 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:15:51,508 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-06 05:15:51,515 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e22bfcf5/a38657fad2034e27bced1aa9cdd3ec31/FLAG2b7ffc6a4 [2022-12-06 05:15:51,532 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e22bfcf5/a38657fad2034e27bced1aa9cdd3ec31 [2022-12-06 05:15:51,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:15:51,539 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:15:51,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:15:51,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:15:51,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:15:51,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f2345d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51, skipping insertion in model container [2022-12-06 05:15:51,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:15:51,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:15:51,736 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 05:15:51,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:15:51,755 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:15:51,787 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 05:15:51,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:15:51,802 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:15:51,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51 WrapperNode [2022-12-06 05:15:51,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:15:51,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:15:51,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:15:51,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:15:51,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,846 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-12-06 05:15:51,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:15:51,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:15:51,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:15:51,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:15:51,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,877 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:15:51,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:15:51,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:15:51,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:15:51,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (1/1) ... [2022-12-06 05:15:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:15:51,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:51,912 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 05:15:51,924 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 05:15:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:15:51,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:15:51,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:15:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:15:51,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:15:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:15:51,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:15:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:15:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:15:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:15:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:15:51,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:15:51,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:15:51,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:15:51,958 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 05:15:52,038 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:15:52,040 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:15:52,274 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:15:52,279 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:15:52,280 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:15:52,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:15:52 BoogieIcfgContainer [2022-12-06 05:15:52,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:15:52,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:15:52,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:15:52,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:15:52,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:15:51" (1/3) ... [2022-12-06 05:15:52,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8defe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:15:52, skipping insertion in model container [2022-12-06 05:15:52,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:15:51" (2/3) ... [2022-12-06 05:15:52,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8defe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:15:52, skipping insertion in model container [2022-12-06 05:15:52,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:15:52" (3/3) ... [2022-12-06 05:15:52,298 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2022-12-06 05:15:52,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:15:52,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:15:52,331 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:15:52,449 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:15:52,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 05:15:52,570 INFO L130 PetriNetUnfolder]: 7/99 cut-off events. [2022-12-06 05:15:52,570 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:15:52,577 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 05:15:52,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 05:15:52,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 89 transitions, 196 flow [2022-12-06 05:15:52,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:52,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-06 05:15:52,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 196 flow [2022-12-06 05:15:52,641 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-06 05:15:52,642 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:15:52,643 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 05:15:52,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-06 05:15:52,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 05:15:55,365 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-06 05:15:55,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:15:55,384 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;@48c24cfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:15:55,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:15:55,389 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 05:15:55,389 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:15:55,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:55,390 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 05:15:55,391 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 05:15:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1839579012, now seen corresponding path program 1 times [2022-12-06 05:15:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239973665] [2022-12-06 05:15:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:55,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239973665] [2022-12-06 05:15:55,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239973665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:55,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:55,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:15:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136125356] [2022-12-06 05:15:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:55,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:15:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:56,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:15:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:15:56,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 05:15:56,016 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 05:15:56,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:56,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 05:15:56,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:56,153 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2022-12-06 05:15:56,153 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 05:15:56,157 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 05:15:56,163 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2022-12-06 05:15:56,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2022-12-06 05:15:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:15:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:15:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 05:15:56,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-12-06 05:15:56,174 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 45 transitions. [2022-12-06 05:15:56,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 179 flow [2022-12-06 05:15:56,176 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 05:15:56,178 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 76 flow [2022-12-06 05:15:56,180 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 05:15:56,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-06 05:15:56,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:56,183 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 76 flow [2022-12-06 05:15:56,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:56,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:56,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 76 flow [2022-12-06 05:15:56,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 76 flow [2022-12-06 05:15:56,204 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 05:15:56,205 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 05:15:56,205 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 05:15:56,205 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 05:15:56,205 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 05:15:56,207 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 05:15:56,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:15:56,208 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 05:15:56,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 76 flow [2022-12-06 05:15:56,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:15:56,210 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:56,213 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:15:56,213 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 76 flow [2022-12-06 05:15:56,213 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 05:15:56,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:56,214 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 05:15:56,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:15:56,218 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 05:15:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1296714879, now seen corresponding path program 1 times [2022-12-06 05:15:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:56,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508609992] [2022-12-06 05:15:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:56,540 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 05:15:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:56,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508609992] [2022-12-06 05:15:56,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508609992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:56,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:56,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:15:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208064382] [2022-12-06 05:15:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:56,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:15:56,550 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 05:15:56,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:56,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:15:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:56,824 INFO L130 PetriNetUnfolder]: 638/974 cut-off events. [2022-12-06 05:15:56,824 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 05:15:56,826 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 05:15:56,832 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 71 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2022-12-06 05:15:56,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 89 transitions, 434 flow [2022-12-06 05:15:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 05:15:56,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2022-12-06 05:15:56,835 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 76 flow. Second operand 7 states and 82 transitions. [2022-12-06 05:15:56,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 89 transitions, 434 flow [2022-12-06 05:15:56,836 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 05:15:56,838 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 139 flow [2022-12-06 05:15:56,838 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 05:15:56,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 05:15:56,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:56,839 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 139 flow [2022-12-06 05:15:56,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:56,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:56,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 139 flow [2022-12-06 05:15:56,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 139 flow [2022-12-06 05:15:56,849 INFO L130 PetriNetUnfolder]: 27/91 cut-off events. [2022-12-06 05:15:56,849 INFO L131 PetriNetUnfolder]: For 25/51 co-relation queries the response was YES. [2022-12-06 05:15:56,849 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 05:15:56,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 139 flow [2022-12-06 05:15:56,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 05:15:56,986 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:15:56,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 05:15:56,988 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 117 flow [2022-12-06 05:15:56,988 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 05:15:56,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:56,988 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 05:15:56,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:15:56,989 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 05:15:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash -941425541, now seen corresponding path program 1 times [2022-12-06 05:15:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:56,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055804430] [2022-12-06 05:15:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:57,163 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 05:15:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055804430] [2022-12-06 05:15:57,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055804430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:57,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783475261] [2022-12-06 05:15:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:57,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:57,179 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 05:15:57,183 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 05:15:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:57,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:15:57,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:57,343 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 05:15:57,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:57,453 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 05:15:57,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783475261] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:57,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:15:57,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 7 [2022-12-06 05:15:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326974908] [2022-12-06 05:15:57,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:57,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 05:15:57,456 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 05:15:57,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:57,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 05:15:57,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:57,792 INFO L130 PetriNetUnfolder]: 665/1029 cut-off events. [2022-12-06 05:15:57,792 INFO L131 PetriNetUnfolder]: For 1397/1405 co-relation queries the response was YES. [2022-12-06 05:15:57,794 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 05:15:57,800 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 87 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2022-12-06 05:15:57,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 100 transitions, 583 flow [2022-12-06 05:15:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-06 05:15:57,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 05:15:57,805 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 117 flow. Second operand 7 states and 105 transitions. [2022-12-06 05:15:57,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 100 transitions, 583 flow [2022-12-06 05:15:57,811 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 05:15:57,812 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 200 flow [2022-12-06 05:15:57,812 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 05:15:57,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 05:15:57,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:57,813 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 200 flow [2022-12-06 05:15:57,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:57,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:57,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 200 flow [2022-12-06 05:15:57,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 200 flow [2022-12-06 05:15:57,825 INFO L130 PetriNetUnfolder]: 30/111 cut-off events. [2022-12-06 05:15:57,825 INFO L131 PetriNetUnfolder]: For 78/89 co-relation queries the response was YES. [2022-12-06 05:15:57,826 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 05:15:57,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 200 flow [2022-12-06 05:15:57,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 05:15:57,838 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 05:15:57,925 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:15:57,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 05:15:57,926 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 192 flow [2022-12-06 05:15:57,926 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 05:15:57,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:57,926 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 05:15:57,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:15:58,132 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 05:15:58,132 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 05:15:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1870699834, now seen corresponding path program 1 times [2022-12-06 05:15:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:58,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062249516] [2022-12-06 05:15:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:58,254 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 05:15:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062249516] [2022-12-06 05:15:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062249516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:58,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795985744] [2022-12-06 05:15:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:58,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:58,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 05:15:58,256 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 05:15:58,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:58,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 05:15:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:58,539 INFO L130 PetriNetUnfolder]: 719/1153 cut-off events. [2022-12-06 05:15:58,540 INFO L131 PetriNetUnfolder]: For 2152/2152 co-relation queries the response was YES. [2022-12-06 05:15:58,542 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 05:15:58,547 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 86 selfloop transitions, 13 changer transitions 4/104 dead transitions. [2022-12-06 05:15:58,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 104 transitions, 671 flow [2022-12-06 05:15:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 05:15:58,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2022-12-06 05:15:58,549 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 192 flow. Second operand 7 states and 106 transitions. [2022-12-06 05:15:58,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 104 transitions, 671 flow [2022-12-06 05:15:58,558 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 05:15:58,559 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 313 flow [2022-12-06 05:15:58,559 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 05:15:58,560 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 05:15:58,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:58,560 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 313 flow [2022-12-06 05:15:58,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:58,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:58,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-06 05:15:58,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 313 flow [2022-12-06 05:15:58,574 INFO L130 PetriNetUnfolder]: 37/160 cut-off events. [2022-12-06 05:15:58,574 INFO L131 PetriNetUnfolder]: For 265/271 co-relation queries the response was YES. [2022-12-06 05:15:58,575 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 05:15:58,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-06 05:15:58,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 05:15:58,580 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 05:15:58,659 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:15:58,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 05:15:58,660 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 325 flow [2022-12-06 05:15:58,660 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 05:15:58,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:58,660 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 05:15:58,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:15:58,661 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 05:15:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -678848004, now seen corresponding path program 2 times [2022-12-06 05:15:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:58,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618780412] [2022-12-06 05:15:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:58,774 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 05:15:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:58,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618780412] [2022-12-06 05:15:58,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618780412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:58,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658412136] [2022-12-06 05:15:58,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:15:58,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:58,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:58,776 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 05:15:58,778 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 05:15:58,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:15:58,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:15:58,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:15:58,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:58,950 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 05:15:58,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:59,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 05:15:59,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658412136] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:59,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:15:59,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 05:15:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037866255] [2022-12-06 05:15:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:59,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:59,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:15:59,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:15:59,009 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 05:15:59,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:59,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:15:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:59,182 INFO L130 PetriNetUnfolder]: 766/1222 cut-off events. [2022-12-06 05:15:59,182 INFO L131 PetriNetUnfolder]: For 4013/4119 co-relation queries the response was YES. [2022-12-06 05:15:59,186 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 05:15:59,192 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 56 selfloop transitions, 11 changer transitions 2/73 dead transitions. [2022-12-06 05:15:59,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 561 flow [2022-12-06 05:15:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:15:59,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 05:15:59,195 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 325 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:15:59,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 561 flow [2022-12-06 05:15:59,206 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 05:15:59,208 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 356 flow [2022-12-06 05:15:59,208 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 05:15:59,210 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 05:15:59,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:59,210 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 356 flow [2022-12-06 05:15:59,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:59,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:59,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 356 flow [2022-12-06 05:15:59,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 356 flow [2022-12-06 05:15:59,240 INFO L130 PetriNetUnfolder]: 42/161 cut-off events. [2022-12-06 05:15:59,241 INFO L131 PetriNetUnfolder]: For 460/476 co-relation queries the response was YES. [2022-12-06 05:15:59,241 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 05:15:59,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 356 flow [2022-12-06 05:15:59,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 05:15:59,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:59,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 05:15:59,247 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 356 flow [2022-12-06 05:15:59,247 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 05:15:59,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:59,247 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 05:15:59,255 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 05:15:59,453 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 05:15:59,454 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 05:15:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 670880502, now seen corresponding path program 1 times [2022-12-06 05:15:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:59,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346791625] [2022-12-06 05:15:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:59,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 05:15:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:59,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346791625] [2022-12-06 05:15:59,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346791625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:59,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:59,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479731120] [2022-12-06 05:15:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:59,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:59,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 05:15:59,682 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 05:15:59,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:59,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 05:15:59,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:59,905 INFO L130 PetriNetUnfolder]: 841/1382 cut-off events. [2022-12-06 05:15:59,905 INFO L131 PetriNetUnfolder]: For 5643/5721 co-relation queries the response was YES. [2022-12-06 05:15:59,909 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 05:15:59,916 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 78 selfloop transitions, 13 changer transitions 7/101 dead transitions. [2022-12-06 05:15:59,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 794 flow [2022-12-06 05:15:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 05:15:59,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-06 05:15:59,918 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 356 flow. Second operand 6 states and 90 transitions. [2022-12-06 05:15:59,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 794 flow [2022-12-06 05:15:59,926 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 05:15:59,927 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 374 flow [2022-12-06 05:15:59,928 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 05:15:59,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2022-12-06 05:15:59,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:59,928 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 374 flow [2022-12-06 05:15:59,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:59,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:59,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 374 flow [2022-12-06 05:15:59,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 374 flow [2022-12-06 05:15:59,947 INFO L130 PetriNetUnfolder]: 43/193 cut-off events. [2022-12-06 05:15:59,947 INFO L131 PetriNetUnfolder]: For 495/511 co-relation queries the response was YES. [2022-12-06 05:15:59,947 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 05:15:59,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 374 flow [2022-12-06 05:15:59,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 05:16:00,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:00,076 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-06 05:16:00,076 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 378 flow [2022-12-06 05:16:00,076 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 05:16:00,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:00,076 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 05:16:00,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:16:00,077 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 05:16:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash -721536866, now seen corresponding path program 2 times [2022-12-06 05:16:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:00,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757264936] [2022-12-06 05:16:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:00,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 05:16:00,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:00,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757264936] [2022-12-06 05:16:00,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757264936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:00,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:00,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385793765] [2022-12-06 05:16:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:00,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:00,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:16:00,224 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 05:16:00,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:00,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:16:00,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:00,483 INFO L130 PetriNetUnfolder]: 757/1225 cut-off events. [2022-12-06 05:16:00,484 INFO L131 PetriNetUnfolder]: For 5342/5381 co-relation queries the response was YES. [2022-12-06 05:16:00,487 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 05:16:00,493 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 83 selfloop transitions, 10 changer transitions 3/99 dead transitions. [2022-12-06 05:16:00,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 800 flow [2022-12-06 05:16:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 05:16:00,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-06 05:16:00,495 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 378 flow. Second operand 6 states and 90 transitions. [2022-12-06 05:16:00,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 800 flow [2022-12-06 05:16:00,500 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 05:16:00,502 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 417 flow [2022-12-06 05:16:00,502 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 05:16:00,503 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 05:16:00,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:00,503 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 417 flow [2022-12-06 05:16:00,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:00,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:00,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 417 flow [2022-12-06 05:16:00,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 417 flow [2022-12-06 05:16:00,520 INFO L130 PetriNetUnfolder]: 37/167 cut-off events. [2022-12-06 05:16:00,520 INFO L131 PetriNetUnfolder]: For 489/506 co-relation queries the response was YES. [2022-12-06 05:16:00,521 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 05:16:00,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 49 transitions, 417 flow [2022-12-06 05:16:00,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 05:16:00,526 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 05:16:00,598 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 05:16:00,670 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 05:16:00,758 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 05:16:00,791 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:00,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-06 05:16:00,792 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 453 flow [2022-12-06 05:16:00,792 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 05:16:00,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:00,792 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 05:16:00,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:16:00,792 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 05:16:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1878822181, now seen corresponding path program 1 times [2022-12-06 05:16:00,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:00,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512291822] [2022-12-06 05:16:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:00,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512291822] [2022-12-06 05:16:00,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512291822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:00,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:00,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:16:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941734387] [2022-12-06 05:16:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:00,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:00,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:16:00,973 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 05:16:00,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:00,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:16:00,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:01,449 INFO L130 PetriNetUnfolder]: 1088/1733 cut-off events. [2022-12-06 05:16:01,449 INFO L131 PetriNetUnfolder]: For 6471/6471 co-relation queries the response was YES. [2022-12-06 05:16:01,454 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 05:16:01,462 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 90 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2022-12-06 05:16:01,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 860 flow [2022-12-06 05:16:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 05:16:01,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-06 05:16:01,463 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 453 flow. Second operand 6 states and 82 transitions. [2022-12-06 05:16:01,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 860 flow [2022-12-06 05:16:01,471 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 05:16:01,472 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 465 flow [2022-12-06 05:16:01,473 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 05:16:01,473 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2022-12-06 05:16:01,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:01,473 INFO L89 Accepts]: Start accepts. Operand has 70 places, 54 transitions, 465 flow [2022-12-06 05:16:01,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:01,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:01,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 54 transitions, 465 flow [2022-12-06 05:16:01,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 465 flow [2022-12-06 05:16:01,493 INFO L130 PetriNetUnfolder]: 55/242 cut-off events. [2022-12-06 05:16:01,493 INFO L131 PetriNetUnfolder]: For 631/671 co-relation queries the response was YES. [2022-12-06 05:16:01,494 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 05:16:01,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 54 transitions, 465 flow [2022-12-06 05:16:01,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 05:16:01,501 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 05:16:01,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:01,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 05:16:01,570 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 465 flow [2022-12-06 05:16:01,570 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 05:16:01,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:01,570 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 05:16:01,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:16:01,571 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 05:16:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1808995553, now seen corresponding path program 1 times [2022-12-06 05:16:01,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:01,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298690493] [2022-12-06 05:16:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:01,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 05:16:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:01,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298690493] [2022-12-06 05:16:01,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298690493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:01,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:01,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390672051] [2022-12-06 05:16:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:01,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:01,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:16:01,727 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 05:16:01,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:01,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:16:01,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:02,003 INFO L130 PetriNetUnfolder]: 1098/1751 cut-off events. [2022-12-06 05:16:02,003 INFO L131 PetriNetUnfolder]: For 7828/7828 co-relation queries the response was YES. [2022-12-06 05:16:02,008 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 05:16:02,017 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 59 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2022-12-06 05:16:02,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 687 flow [2022-12-06 05:16:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:16:02,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:16:02,018 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 465 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:16:02,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 687 flow [2022-12-06 05:16:02,029 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 05:16:02,030 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 503 flow [2022-12-06 05:16:02,031 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 05:16:02,031 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 05:16:02,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:02,031 INFO L89 Accepts]: Start accepts. Operand has 73 places, 55 transitions, 503 flow [2022-12-06 05:16:02,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:02,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:02,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 55 transitions, 503 flow [2022-12-06 05:16:02,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 55 transitions, 503 flow [2022-12-06 05:16:02,051 INFO L130 PetriNetUnfolder]: 55/244 cut-off events. [2022-12-06 05:16:02,051 INFO L131 PetriNetUnfolder]: For 795/868 co-relation queries the response was YES. [2022-12-06 05:16:02,052 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 05:16:02,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 55 transitions, 503 flow [2022-12-06 05:16:02,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 05:16:02,102 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 05:16:02,143 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:02,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 05:16:02,144 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 500 flow [2022-12-06 05:16:02,145 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 05:16:02,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:02,145 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 05:16:02,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:16:02,145 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 05:16:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 279195164, now seen corresponding path program 1 times [2022-12-06 05:16:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:02,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712421559] [2022-12-06 05:16:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:02,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 05:16:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:02,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712421559] [2022-12-06 05:16:02,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712421559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:02,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:02,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663788864] [2022-12-06 05:16:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:02,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:02,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 05:16:02,311 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 05:16:02,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:02,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 05:16:02,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:02,703 INFO L130 PetriNetUnfolder]: 1087/1724 cut-off events. [2022-12-06 05:16:02,703 INFO L131 PetriNetUnfolder]: For 8007/8007 co-relation queries the response was YES. [2022-12-06 05:16:02,707 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 05:16:02,722 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 68 selfloop transitions, 4 changer transitions 9/81 dead transitions. [2022-12-06 05:16:02,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 792 flow [2022-12-06 05:16:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 05:16:02,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:16:02,724 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 500 flow. Second operand 5 states and 66 transitions. [2022-12-06 05:16:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 792 flow [2022-12-06 05:16:02,735 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 05:16:02,737 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 461 flow [2022-12-06 05:16:02,737 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 05:16:02,738 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2022-12-06 05:16:02,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:02,738 INFO L89 Accepts]: Start accepts. Operand has 75 places, 52 transitions, 461 flow [2022-12-06 05:16:02,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:02,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:02,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 52 transitions, 461 flow [2022-12-06 05:16:02,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 461 flow [2022-12-06 05:16:02,758 INFO L130 PetriNetUnfolder]: 55/229 cut-off events. [2022-12-06 05:16:02,759 INFO L131 PetriNetUnfolder]: For 681/720 co-relation queries the response was YES. [2022-12-06 05:16:02,760 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 05:16:02,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 52 transitions, 461 flow [2022-12-06 05:16:02,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 05:16:02,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:02,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 05:16:02,763 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 461 flow [2022-12-06 05:16:02,763 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 05:16:02,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:02,763 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 05:16:02,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:16:02,764 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 05:16:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 914320107, now seen corresponding path program 1 times [2022-12-06 05:16:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:02,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167654158] [2022-12-06 05:16:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:02,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 05:16:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:02,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167654158] [2022-12-06 05:16:02,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167654158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:02,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:02,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034724407] [2022-12-06 05:16:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:02,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:02,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:02,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:16:02,934 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 05:16:02,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:02,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:16:02,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:03,167 INFO L130 PetriNetUnfolder]: 1098/1733 cut-off events. [2022-12-06 05:16:03,167 INFO L131 PetriNetUnfolder]: For 7867/7867 co-relation queries the response was YES. [2022-12-06 05:16:03,173 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 05:16:03,180 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 57 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2022-12-06 05:16:03,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 686 flow [2022-12-06 05:16:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 05:16:03,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:16:03,182 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 461 flow. Second operand 4 states and 56 transitions. [2022-12-06 05:16:03,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 686 flow [2022-12-06 05:16:03,192 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 05:16:03,193 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 494 flow [2022-12-06 05:16:03,193 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 05:16:03,194 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2022-12-06 05:16:03,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:03,194 INFO L89 Accepts]: Start accepts. Operand has 69 places, 54 transitions, 494 flow [2022-12-06 05:16:03,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:03,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:03,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 54 transitions, 494 flow [2022-12-06 05:16:03,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 54 transitions, 494 flow [2022-12-06 05:16:03,211 INFO L130 PetriNetUnfolder]: 56/232 cut-off events. [2022-12-06 05:16:03,211 INFO L131 PetriNetUnfolder]: For 722/755 co-relation queries the response was YES. [2022-12-06 05:16:03,212 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 05:16:03,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 54 transitions, 494 flow [2022-12-06 05:16:03,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 05:16:03,265 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 05:16:03,322 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:03,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 05:16:03,323 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 491 flow [2022-12-06 05:16:03,323 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 05:16:03,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:03,323 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 05:16:03,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:16:03,323 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 05:16:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1487690506, now seen corresponding path program 1 times [2022-12-06 05:16:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:03,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106260336] [2022-12-06 05:16:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:03,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 05:16:03,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:03,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106260336] [2022-12-06 05:16:03,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106260336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:03,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:03,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:16:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633821357] [2022-12-06 05:16:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:03,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:03,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:03,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:03,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 05:16:03,486 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 05:16:03,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:03,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 05:16:03,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:03,672 INFO L130 PetriNetUnfolder]: 1017/1622 cut-off events. [2022-12-06 05:16:03,672 INFO L131 PetriNetUnfolder]: For 7550/7615 co-relation queries the response was YES. [2022-12-06 05:16:03,678 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 05:16:03,685 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 55 selfloop transitions, 12 changer transitions 5/76 dead transitions. [2022-12-06 05:16:03,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 733 flow [2022-12-06 05:16:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 05:16:03,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-06 05:16:03,686 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 491 flow. Second operand 4 states and 67 transitions. [2022-12-06 05:16:03,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 733 flow [2022-12-06 05:16:03,696 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 05:16:03,698 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 520 flow [2022-12-06 05:16:03,698 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 05:16:03,698 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2022-12-06 05:16:03,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:03,698 INFO L89 Accepts]: Start accepts. Operand has 70 places, 55 transitions, 520 flow [2022-12-06 05:16:03,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:03,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:03,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 55 transitions, 520 flow [2022-12-06 05:16:03,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 55 transitions, 520 flow [2022-12-06 05:16:03,716 INFO L130 PetriNetUnfolder]: 57/237 cut-off events. [2022-12-06 05:16:03,717 INFO L131 PetriNetUnfolder]: For 838/885 co-relation queries the response was YES. [2022-12-06 05:16:03,718 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 05:16:03,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 55 transitions, 520 flow [2022-12-06 05:16:03,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 05:16:03,726 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 05:16:03,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:03,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:16:03,874 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 527 flow [2022-12-06 05:16:03,874 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 05:16:03,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:03,875 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 05:16:03,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:16:03,875 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 05:16:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -337733152, now seen corresponding path program 1 times [2022-12-06 05:16:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:03,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948135586] [2022-12-06 05:16:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:04,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 05:16:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:04,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948135586] [2022-12-06 05:16:04,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948135586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:04,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:04,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929023688] [2022-12-06 05:16:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:04,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:04,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:16:04,010 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 05:16:04,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:04,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:16:04,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:04,259 INFO L130 PetriNetUnfolder]: 1039/1634 cut-off events. [2022-12-06 05:16:04,260 INFO L131 PetriNetUnfolder]: For 8515/8529 co-relation queries the response was YES. [2022-12-06 05:16:04,265 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 05:16:04,271 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 57 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2022-12-06 05:16:04,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 763 flow [2022-12-06 05:16:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 05:16:04,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2022-12-06 05:16:04,272 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 527 flow. Second operand 5 states and 68 transitions. [2022-12-06 05:16:04,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 763 flow [2022-12-06 05:16:04,287 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 05:16:04,289 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 528 flow [2022-12-06 05:16:04,289 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 05:16:04,289 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2022-12-06 05:16:04,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:04,290 INFO L89 Accepts]: Start accepts. Operand has 71 places, 55 transitions, 528 flow [2022-12-06 05:16:04,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:04,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:04,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 55 transitions, 528 flow [2022-12-06 05:16:04,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 55 transitions, 528 flow [2022-12-06 05:16:04,306 INFO L130 PetriNetUnfolder]: 58/224 cut-off events. [2022-12-06 05:16:04,307 INFO L131 PetriNetUnfolder]: For 745/779 co-relation queries the response was YES. [2022-12-06 05:16:04,307 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 05:16:04,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 55 transitions, 528 flow [2022-12-06 05:16:04,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 05:16:04,312 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 05:16:04,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:04,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 05:16:04,382 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 535 flow [2022-12-06 05:16:04,383 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 05:16:04,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:04,383 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 05:16:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:16:04,383 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 05:16:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2062324218, now seen corresponding path program 1 times [2022-12-06 05:16:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:04,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145710301] [2022-12-06 05:16:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:04,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 05:16:04,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:04,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145710301] [2022-12-06 05:16:04,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145710301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:04,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:04,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253676654] [2022-12-06 05:16:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:04,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:04,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:04,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 05:16:04,598 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 05:16:04,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:04,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 05:16:04,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:04,994 INFO L130 PetriNetUnfolder]: 1114/1741 cut-off events. [2022-12-06 05:16:04,994 INFO L131 PetriNetUnfolder]: For 7880/7880 co-relation queries the response was YES. [2022-12-06 05:16:04,999 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 05:16:05,005 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 68 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2022-12-06 05:16:05,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 831 flow [2022-12-06 05:16:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 05:16:05,007 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2022-12-06 05:16:05,007 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 535 flow. Second operand 5 states and 69 transitions. [2022-12-06 05:16:05,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 831 flow [2022-12-06 05:16:05,020 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 05:16:05,021 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 560 flow [2022-12-06 05:16:05,021 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 05:16:05,022 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2022-12-06 05:16:05,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:05,022 INFO L89 Accepts]: Start accepts. Operand has 74 places, 58 transitions, 560 flow [2022-12-06 05:16:05,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:05,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:05,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 58 transitions, 560 flow [2022-12-06 05:16:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 58 transitions, 560 flow [2022-12-06 05:16:05,042 INFO L130 PetriNetUnfolder]: 72/262 cut-off events. [2022-12-06 05:16:05,042 INFO L131 PetriNetUnfolder]: For 1137/1202 co-relation queries the response was YES. [2022-12-06 05:16:05,043 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 05:16:05,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 58 transitions, 560 flow [2022-12-06 05:16:05,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 05:16:05,052 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 05:16:05,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:05,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 05:16:05,287 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 586 flow [2022-12-06 05:16:05,287 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 05:16:05,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:05,287 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 05:16:05,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:16:05,287 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 05:16:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1345139397, now seen corresponding path program 1 times [2022-12-06 05:16:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:05,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274000314] [2022-12-06 05:16:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274000314] [2022-12-06 05:16:05,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274000314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:05,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:05,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:16:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129850369] [2022-12-06 05:16:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:05,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:05,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-06 05:16:05,433 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 05:16:05,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:05,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-06 05:16:05,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:05,631 INFO L130 PetriNetUnfolder]: 1037/1642 cut-off events. [2022-12-06 05:16:05,631 INFO L131 PetriNetUnfolder]: For 11477/11540 co-relation queries the response was YES. [2022-12-06 05:16:05,636 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 05:16:05,643 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 57 selfloop transitions, 14 changer transitions 6/81 dead transitions. [2022-12-06 05:16:05,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 854 flow [2022-12-06 05:16:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 05:16:05,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-06 05:16:05,644 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 586 flow. Second operand 4 states and 70 transitions. [2022-12-06 05:16:05,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 854 flow [2022-12-06 05:16:05,660 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 05:16:05,662 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 587 flow [2022-12-06 05:16:05,662 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 05:16:05,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2022-12-06 05:16:05,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:05,662 INFO L89 Accepts]: Start accepts. Operand has 76 places, 59 transitions, 587 flow [2022-12-06 05:16:05,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:05,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:05,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 59 transitions, 587 flow [2022-12-06 05:16:05,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 59 transitions, 587 flow [2022-12-06 05:16:05,692 INFO L130 PetriNetUnfolder]: 75/268 cut-off events. [2022-12-06 05:16:05,692 INFO L131 PetriNetUnfolder]: For 1425/1514 co-relation queries the response was YES. [2022-12-06 05:16:05,693 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 05:16:05,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 59 transitions, 587 flow [2022-12-06 05:16:05,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 05:16:05,696 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:05,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 05:16:05,696 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 587 flow [2022-12-06 05:16:05,696 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 05:16:05,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:05,697 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 05:16:05,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:16:05,697 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 05:16:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1092628300, now seen corresponding path program 1 times [2022-12-06 05:16:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:05,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313456388] [2022-12-06 05:16:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:05,802 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 05:16:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:05,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313456388] [2022-12-06 05:16:05,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313456388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:16:05,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131127485] [2022-12-06 05:16:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:05,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:16:05,808 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 05:16:05,838 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 05:16:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:05,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:16:05,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:16:05,947 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 05:16:05,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:16:05,984 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 05:16:05,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131127485] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 05:16:05,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 05:16:05,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2022-12-06 05:16:05,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270562879] [2022-12-06 05:16:05,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:05,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:16:05,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:16:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:05,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 05:16:05,986 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 05:16:05,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:05,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 05:16:05,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:06,167 INFO L130 PetriNetUnfolder]: 1023/1603 cut-off events. [2022-12-06 05:16:06,168 INFO L131 PetriNetUnfolder]: For 12200/12264 co-relation queries the response was YES. [2022-12-06 05:16:06,173 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 05:16:06,179 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 52 selfloop transitions, 11 changer transitions 4/71 dead transitions. [2022-12-06 05:16:06,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 755 flow [2022-12-06 05:16:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:16:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:16:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 05:16:06,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-06 05:16:06,181 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 587 flow. Second operand 3 states and 56 transitions. [2022-12-06 05:16:06,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 755 flow [2022-12-06 05:16:06,196 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 05:16:06,197 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 550 flow [2022-12-06 05:16:06,197 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 05:16:06,197 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 05:16:06,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:06,198 INFO L89 Accepts]: Start accepts. Operand has 73 places, 58 transitions, 550 flow [2022-12-06 05:16:06,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:06,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:06,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 58 transitions, 550 flow [2022-12-06 05:16:06,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 58 transitions, 550 flow [2022-12-06 05:16:06,218 INFO L130 PetriNetUnfolder]: 75/261 cut-off events. [2022-12-06 05:16:06,218 INFO L131 PetriNetUnfolder]: For 1315/1381 co-relation queries the response was YES. [2022-12-06 05:16:06,219 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 05:16:06,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 58 transitions, 550 flow [2022-12-06 05:16:06,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 05:16:06,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:06,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 05:16:06,222 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 550 flow [2022-12-06 05:16:06,222 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 05:16:06,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:06,222 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 05:16:06,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:16:06,430 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 05:16:06,430 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 05:16:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1846577865, now seen corresponding path program 1 times [2022-12-06 05:16:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:06,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7405126] [2022-12-06 05:16:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:06,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 05:16:06,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:06,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7405126] [2022-12-06 05:16:06,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7405126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:06,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:06,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:16:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214363989] [2022-12-06 05:16:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:06,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:06,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:16:06,562 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 05:16:06,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:06,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:16:06,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:06,981 INFO L130 PetriNetUnfolder]: 1093/1718 cut-off events. [2022-12-06 05:16:06,982 INFO L131 PetriNetUnfolder]: For 12494/12507 co-relation queries the response was YES. [2022-12-06 05:16:06,987 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 05:16:06,993 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 92 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2022-12-06 05:16:06,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 977 flow [2022-12-06 05:16:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 05:16:06,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3963963963963964 [2022-12-06 05:16:06,995 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 550 flow. Second operand 6 states and 88 transitions. [2022-12-06 05:16:06,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 977 flow [2022-12-06 05:16:07,012 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 05:16:07,014 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 590 flow [2022-12-06 05:16:07,014 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 05:16:07,014 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-06 05:16:07,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:07,014 INFO L89 Accepts]: Start accepts. Operand has 80 places, 61 transitions, 590 flow [2022-12-06 05:16:07,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:07,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:07,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 61 transitions, 590 flow [2022-12-06 05:16:07,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 61 transitions, 590 flow [2022-12-06 05:16:07,035 INFO L130 PetriNetUnfolder]: 76/273 cut-off events. [2022-12-06 05:16:07,035 INFO L131 PetriNetUnfolder]: For 1325/1402 co-relation queries the response was YES. [2022-12-06 05:16:07,036 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 05:16:07,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 61 transitions, 590 flow [2022-12-06 05:16:07,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 05:16:07,088 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 05:16:07,162 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:07,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 05:16:07,163 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 589 flow [2022-12-06 05:16:07,163 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 05:16:07,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:07,163 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 05:16:07,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:16:07,164 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 05:16:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1236145212, now seen corresponding path program 1 times [2022-12-06 05:16:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:07,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212966823] [2022-12-06 05:16:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:07,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:07,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212966823] [2022-12-06 05:16:07,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212966823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:07,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:07,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:07,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580372443] [2022-12-06 05:16:07,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:07,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:16:07,283 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 05:16:07,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:07,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:16:07,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:07,688 INFO L130 PetriNetUnfolder]: 1479/2297 cut-off events. [2022-12-06 05:16:07,688 INFO L131 PetriNetUnfolder]: For 16003/16003 co-relation queries the response was YES. [2022-12-06 05:16:07,695 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 05:16:07,703 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 103 selfloop transitions, 14 changer transitions 2/119 dead transitions. [2022-12-06 05:16:07,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 1279 flow [2022-12-06 05:16:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 05:16:07,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2022-12-06 05:16:07,705 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 589 flow. Second operand 5 states and 88 transitions. [2022-12-06 05:16:07,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 1279 flow [2022-12-06 05:16:07,736 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 05:16:07,737 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 688 flow [2022-12-06 05:16:07,738 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 05:16:07,738 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-06 05:16:07,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:07,738 INFO L89 Accepts]: Start accepts. Operand has 83 places, 65 transitions, 688 flow [2022-12-06 05:16:07,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:07,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:07,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 65 transitions, 688 flow [2022-12-06 05:16:07,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 65 transitions, 688 flow [2022-12-06 05:16:07,768 INFO L130 PetriNetUnfolder]: 99/340 cut-off events. [2022-12-06 05:16:07,768 INFO L131 PetriNetUnfolder]: For 2130/2214 co-relation queries the response was YES. [2022-12-06 05:16:07,770 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 05:16:07,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 65 transitions, 688 flow [2022-12-06 05:16:07,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 05:16:07,775 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 05:16:07,800 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 05:16:07,850 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:07,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 05:16:07,851 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 695 flow [2022-12-06 05:16:07,851 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 05:16:07,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:07,852 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 05:16:07,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:16:07,852 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 05:16:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -868885621, now seen corresponding path program 1 times [2022-12-06 05:16:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974296516] [2022-12-06 05:16:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:07,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:07,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 05:16:08,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:08,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974296516] [2022-12-06 05:16:08,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974296516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:08,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:08,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072842321] [2022-12-06 05:16:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:08,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:08,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:08,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:16:08,001 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 05:16:08,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:08,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:16:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:08,403 INFO L130 PetriNetUnfolder]: 1391/2182 cut-off events. [2022-12-06 05:16:08,403 INFO L131 PetriNetUnfolder]: For 19789/19830 co-relation queries the response was YES. [2022-12-06 05:16:08,409 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 05:16:08,416 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 84 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2022-12-06 05:16:08,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 96 transitions, 1044 flow [2022-12-06 05:16:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 05:16:08,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 05:16:08,417 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 695 flow. Second operand 5 states and 75 transitions. [2022-12-06 05:16:08,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 96 transitions, 1044 flow [2022-12-06 05:16:08,440 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 05:16:08,442 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 675 flow [2022-12-06 05:16:08,442 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 05:16:08,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2022-12-06 05:16:08,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:08,442 INFO L89 Accepts]: Start accepts. Operand has 87 places, 65 transitions, 675 flow [2022-12-06 05:16:08,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:08,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:08,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 65 transitions, 675 flow [2022-12-06 05:16:08,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 65 transitions, 675 flow [2022-12-06 05:16:08,470 INFO L130 PetriNetUnfolder]: 99/342 cut-off events. [2022-12-06 05:16:08,470 INFO L131 PetriNetUnfolder]: For 2064/2159 co-relation queries the response was YES. [2022-12-06 05:16:08,472 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 05:16:08,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 65 transitions, 675 flow [2022-12-06 05:16:08,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 05:16:08,531 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 05:16:08,593 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 05:16:08,668 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 05:16:08,708 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:08,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 05:16:08,709 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 745 flow [2022-12-06 05:16:08,709 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 05:16:08,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:08,710 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 05:16:08,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:16:08,710 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 05:16:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 182603322, now seen corresponding path program 2 times [2022-12-06 05:16:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:08,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645306044] [2022-12-06 05:16:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:08,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645306044] [2022-12-06 05:16:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645306044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:08,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:08,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:16:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29939628] [2022-12-06 05:16:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:08,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:16:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:16:08,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:16:08,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:16:08,849 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 05:16:08,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:08,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:16:08,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:09,311 INFO L130 PetriNetUnfolder]: 1553/2443 cut-off events. [2022-12-06 05:16:09,311 INFO L131 PetriNetUnfolder]: For 18762/18762 co-relation queries the response was YES. [2022-12-06 05:16:09,319 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 05:16:09,327 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 109 selfloop transitions, 26 changer transitions 1/136 dead transitions. [2022-12-06 05:16:09,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 136 transitions, 1432 flow [2022-12-06 05:16:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:16:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:16:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 05:16:09,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2022-12-06 05:16:09,329 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 745 flow. Second operand 7 states and 111 transitions. [2022-12-06 05:16:09,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 136 transitions, 1432 flow [2022-12-06 05:16:09,357 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 05:16:09,359 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 909 flow [2022-12-06 05:16:09,359 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 05:16:09,359 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2022-12-06 05:16:09,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:09,359 INFO L89 Accepts]: Start accepts. Operand has 91 places, 77 transitions, 909 flow [2022-12-06 05:16:09,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:09,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:09,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 77 transitions, 909 flow [2022-12-06 05:16:09,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 77 transitions, 909 flow [2022-12-06 05:16:09,391 INFO L130 PetriNetUnfolder]: 108/388 cut-off events. [2022-12-06 05:16:09,391 INFO L131 PetriNetUnfolder]: For 2786/2936 co-relation queries the response was YES. [2022-12-06 05:16:09,393 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 05:16:09,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 77 transitions, 909 flow [2022-12-06 05:16:09,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 05:16:09,397 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 05:16:09,421 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 05:16:09,469 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:09,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 05:16:09,470 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 924 flow [2022-12-06 05:16:09,471 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 05:16:09,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:09,471 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 05:16:09,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:16:09,471 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 05:16:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1807388423, now seen corresponding path program 1 times [2022-12-06 05:16:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:09,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331720188] [2022-12-06 05:16:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:09,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 05:16:09,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:09,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331720188] [2022-12-06 05:16:09,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331720188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:09,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:09,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167874460] [2022-12-06 05:16:09,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:09,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:09,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:09,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:09,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:16:09,581 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 05:16:09,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:09,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:16:09,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:09,951 INFO L130 PetriNetUnfolder]: 1459/2322 cut-off events. [2022-12-06 05:16:09,951 INFO L131 PetriNetUnfolder]: For 23022/23071 co-relation queries the response was YES. [2022-12-06 05:16:09,958 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 05:16:09,967 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 91 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2022-12-06 05:16:09,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 107 transitions, 1281 flow [2022-12-06 05:16:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-06 05:16:09,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:16:09,968 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 924 flow. Second operand 5 states and 77 transitions. [2022-12-06 05:16:09,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 107 transitions, 1281 flow [2022-12-06 05:16:10,006 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 05:16:10,008 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 897 flow [2022-12-06 05:16:10,008 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 05:16:10,009 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2022-12-06 05:16:10,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:10,009 INFO L89 Accepts]: Start accepts. Operand has 96 places, 77 transitions, 897 flow [2022-12-06 05:16:10,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:10,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:10,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 77 transitions, 897 flow [2022-12-06 05:16:10,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 77 transitions, 897 flow [2022-12-06 05:16:10,045 INFO L130 PetriNetUnfolder]: 106/393 cut-off events. [2022-12-06 05:16:10,045 INFO L131 PetriNetUnfolder]: For 2641/2808 co-relation queries the response was YES. [2022-12-06 05:16:10,046 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 05:16:10,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 77 transitions, 897 flow [2022-12-06 05:16:10,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 05:16:10,052 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 05:16:10,093 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 05:16:10,379 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:16:10,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 05:16:10,380 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 894 flow [2022-12-06 05:16:10,380 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 05:16:10,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:10,381 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 05:16:10,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:16:10,381 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 05:16:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash 18366823, now seen corresponding path program 1 times [2022-12-06 05:16:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:10,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821637206] [2022-12-06 05:16:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:10,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 05:16:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821637206] [2022-12-06 05:16:10,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821637206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:10,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:10,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:16:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060554994] [2022-12-06 05:16:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:10,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:10,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 05:16:10,570 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 05:16:10,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:10,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 05:16:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:10,918 INFO L130 PetriNetUnfolder]: 1531/2457 cut-off events. [2022-12-06 05:16:10,918 INFO L131 PetriNetUnfolder]: For 21345/21454 co-relation queries the response was YES. [2022-12-06 05:16:10,925 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 05:16:10,933 INFO L137 encePairwiseOnDemand]: 23/41 looper letters, 83 selfloop transitions, 36 changer transitions 5/128 dead transitions. [2022-12-06 05:16:10,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 1516 flow [2022-12-06 05:16:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-06 05:16:10,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4585365853658537 [2022-12-06 05:16:10,934 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 894 flow. Second operand 5 states and 94 transitions. [2022-12-06 05:16:10,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 1516 flow [2022-12-06 05:16:10,965 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 05:16:10,967 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 1167 flow [2022-12-06 05:16:10,967 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 05:16:10,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2022-12-06 05:16:10,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:10,968 INFO L89 Accepts]: Start accepts. Operand has 97 places, 91 transitions, 1167 flow [2022-12-06 05:16:10,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:10,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:10,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 91 transitions, 1167 flow [2022-12-06 05:16:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 91 transitions, 1167 flow [2022-12-06 05:16:11,002 INFO L130 PetriNetUnfolder]: 114/427 cut-off events. [2022-12-06 05:16:11,002 INFO L131 PetriNetUnfolder]: For 3257/3386 co-relation queries the response was YES. [2022-12-06 05:16:11,003 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 05:16:11,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 91 transitions, 1167 flow [2022-12-06 05:16:11,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 05:16:11,089 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 05:16:11,131 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:11,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 05:16:11,132 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 1200 flow [2022-12-06 05:16:11,132 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 05:16:11,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:11,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 05:16:11,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:16:11,132 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 05:16:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1014931543, now seen corresponding path program 1 times [2022-12-06 05:16:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:11,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051139580] [2022-12-06 05:16:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:11,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:11,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 05:16:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051139580] [2022-12-06 05:16:11,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051139580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:11,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:11,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715517044] [2022-12-06 05:16:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:11,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:11,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:11,230 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 05:16:11,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:11,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:11,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:11,552 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:11,552 INFO L131 PetriNetUnfolder]: For 27270/27316 co-relation queries the response was YES. [2022-12-06 05:16:11,559 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 05:16:11,567 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:11,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 1573 flow [2022-12-06 05:16:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:11,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:11,568 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 1200 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:11,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 1573 flow [2022-12-06 05:16:11,605 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 05:16:11,606 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:11,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 05:16:11,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:11,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:11,607 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:11,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:11,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:11,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:11,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:11,636 INFO L130 PetriNetUnfolder]: 112/426 cut-off events. [2022-12-06 05:16:11,636 INFO L131 PetriNetUnfolder]: For 3048/3187 co-relation queries the response was YES. [2022-12-06 05:16:11,638 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 05:16:11,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:11,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:11,642 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 05:16:11,864 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:11,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 05:16:11,864 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1193 flow [2022-12-06 05:16:11,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:11,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:11,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 05:16:11,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:16:11,865 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 05:16:11,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1661342501, now seen corresponding path program 1 times [2022-12-06 05:16:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:11,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696451784] [2022-12-06 05:16:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:11,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:11,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696451784] [2022-12-06 05:16:11,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696451784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:11,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:11,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:11,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875128466] [2022-12-06 05:16:11,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:11,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:11,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:11,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:11,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:11,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:11,969 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 05:16:11,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:11,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:11,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:12,347 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:12,348 INFO L131 PetriNetUnfolder]: For 27017/27062 co-relation queries the response was YES. [2022-12-06 05:16:12,358 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 05:16:12,369 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:12,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1566 flow [2022-12-06 05:16:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:12,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:12,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1193 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:12,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1566 flow [2022-12-06 05:16:12,420 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 05:16:12,423 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:12,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:12,423 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:12,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:12,423 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:12,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:12,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:12,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:12,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:12,459 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:12,459 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:12,461 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 05:16:12,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:12,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:12,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:12,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 05:16:12,637 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:12,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 05:16:12,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:12,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 05:16:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:16:12,637 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 05:16:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -890814460, now seen corresponding path program 1 times [2022-12-06 05:16:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:12,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753871165] [2022-12-06 05:16:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:12,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 05:16:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753871165] [2022-12-06 05:16:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753871165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:12,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:12,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075541102] [2022-12-06 05:16:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:12,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:12,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:12,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:12,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:12,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:12,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:13,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:13,117 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:13,124 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 05:16:13,131 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:13,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:13,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:13,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 05:16:13,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:13,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 05:16:13,175 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:13,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:13,175 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:13,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:13,175 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:13,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:13,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:13,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:13,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:13,205 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:13,205 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:13,207 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 05:16:13,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:13,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:13,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:13,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 05:16:13,379 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:13,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:13,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:13,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:13,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:16:13,379 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 05:16:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash 851995875, now seen corresponding path program 1 times [2022-12-06 05:16:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122634296] [2022-12-06 05:16:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:13,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 05:16:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:13,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122634296] [2022-12-06 05:16:13,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122634296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:13,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:13,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108381889] [2022-12-06 05:16:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:13,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:13,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:13,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:13,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:13,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:13,955 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:13,955 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16: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 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 05:16:13,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:13,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:13,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:13,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 05:16:13,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:14,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:14,023 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,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 05:16:14,024 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:14,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:14,024 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:14,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:14,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,061 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:14,061 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:14,063 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 05:16:14,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:14,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:14,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 05:16:14,259 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:14,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 05:16:14,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:14,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:14,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:16:14,260 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 05:16:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1700161086, now seen corresponding path program 1 times [2022-12-06 05:16:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205684850] [2022-12-06 05:16:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:14,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 05:16:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:14,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205684850] [2022-12-06 05:16:14,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205684850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:14,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:14,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821417850] [2022-12-06 05:16:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:14,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:14,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:14,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 05:16:14,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:14,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:14,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:14,736 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:14,736 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:14,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 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 05:16:14,776 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:14,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:14,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:14,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 05:16:14,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:14,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:14,807 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:14,808 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:14,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:14,808 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:14,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:14,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,837 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:14,837 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:16:14,838 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 05:16:14,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:14,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:15,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:15,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:16:15,013 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:15,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 05:16:15,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:15,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 05:16:15,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:16:15,013 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 05:16:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 42649249, now seen corresponding path program 1 times [2022-12-06 05:16:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:15,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495994890] [2022-12-06 05:16:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495994890] [2022-12-06 05:16:15,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495994890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:15,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:15,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350979639] [2022-12-06 05:16:15,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:15,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:15,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:15,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 05:16:15,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:15,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:15,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:15,418 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:15,418 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:15,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:16:15,432 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:15,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:15,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:15,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 05:16:15,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:15,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 05:16:15,470 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:15,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 05:16:15,470 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:15,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:15,471 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:15,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:15,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:15,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:15,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:15,498 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:15,498 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:15,499 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 05:16:15,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:15,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:15,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:15,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 05:16:15,680 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:15,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:15,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:15,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:15,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:16:15,680 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 05:16:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1785459584, now seen corresponding path program 1 times [2022-12-06 05:16:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:15,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645603914] [2022-12-06 05:16:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:15,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 05:16:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:15,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645603914] [2022-12-06 05:16:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645603914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:15,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:15,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622400638] [2022-12-06 05:16:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:15,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:15,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:15,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 05:16:15,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:15,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:15,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:16,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:16,168 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:16,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 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 05:16:16,182 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:16,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:16,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:16,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 05:16:16,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:16,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 05:16:16,218 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,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 05:16:16,219 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:16,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:16,220 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:16,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:16,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,248 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:16,248 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:16:16,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 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 05:16:16,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:16,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:16,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:16:16,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:16,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 05:16:16,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:16,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 05:16:16,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:16:16,411 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 05:16:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -766697377, now seen corresponding path program 1 times [2022-12-06 05:16:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653697161] [2022-12-06 05:16:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:16,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:16,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653697161] [2022-12-06 05:16:16,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653697161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:16,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:16,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976914930] [2022-12-06 05:16:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:16,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:16,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:16,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:16,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 05:16:16,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:16,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:16,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:16,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:16,916 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:16,925 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 05:16:16,931 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:16,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:16,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:16,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 05:16:16,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:16,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 05:16:16,965 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,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 05:16:16,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:16,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:16,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:16,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:16,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:16,996 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:16,997 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:16,998 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 05:16:17,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:17,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:17,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:17,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 05:16:17,184 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:17,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:17,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:17,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 05:16:17,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:16:17,185 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 05:16:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 976112958, now seen corresponding path program 1 times [2022-12-06 05:16:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:17,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751572275] [2022-12-06 05:16:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:17,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 05:16:17,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:17,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751572275] [2022-12-06 05:16:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751572275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:17,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:17,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652088334] [2022-12-06 05:16:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:17,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:17,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:17,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:17,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:17,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 05:16:17,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:17,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:17,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:17,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:17,632 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:17,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 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 05:16:17,647 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:17,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:17,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:17,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 05:16:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:17,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 05:16:17,683 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:17,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 05:16:17,684 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:17,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:17,684 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:17,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:17,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:17,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:17,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:17,715 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:17,716 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:17,717 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 05:16:17,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:17,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:17,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:17,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:16:17,884 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:17,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 05:16:17,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:17,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 05:16:17,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:16:17,885 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 05:16:17,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1576044003, now seen corresponding path program 1 times [2022-12-06 05:16:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:17,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037380012] [2022-12-06 05:16:17,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:17,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037380012] [2022-12-06 05:16:17,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037380012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:17,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:17,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957199398] [2022-12-06 05:16:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:17,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:17,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:17,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 05:16:17,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:17,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:17,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:18,348 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:18,348 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:18,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:16:18,369 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:18,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:18,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:18,370 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:18,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:18,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 05:16:18,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:18,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 05:16:18,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:18,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:18,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:18,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:18,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:18,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:18,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:18,457 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:18,458 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:18,460 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 05:16:18,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:18,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:18,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:18,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 05:16:18,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:18,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 05:16:18,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:18,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 05:16:18,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:16:18,648 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 05:16:18,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 166766332, now seen corresponding path program 1 times [2022-12-06 05:16:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:18,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990727604] [2022-12-06 05:16:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:18,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 05:16:18,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990727604] [2022-12-06 05:16:18,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990727604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:18,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108928119] [2022-12-06 05:16:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:18,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:18,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:18,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:18,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 05:16:18,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:18,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:18,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:19,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:19,134 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:19,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:19,151 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:19,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:19,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:19,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 05:16:19,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:19,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 05:16:19,195 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,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 05:16:19,196 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:19,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:19,196 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:19,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:19,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,230 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:19,230 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:16:19,232 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 05:16:19,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:19,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:19,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 05:16:19,435 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:19,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 05:16:19,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:19,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:19,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:16:19,436 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 05:16:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1909576667, now seen corresponding path program 1 times [2022-12-06 05:16:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:19,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313388946] [2022-12-06 05:16:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:19,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 05:16:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313388946] [2022-12-06 05:16:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313388946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:19,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:19,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876965612] [2022-12-06 05:16:19,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:19,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:19,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:19,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:19,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:19,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 05:16:19,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:19,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:19,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:19,896 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:19,897 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:16:19,907 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 05:16:19,917 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:19,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:19,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:19,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 05:16:19,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:19,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:19,968 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,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 05:16:19,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:19,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:19,968 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:19,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:19,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:19,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,004 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:20,005 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:16:20,007 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 05:16:20,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:20,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:20,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 05:16:20,211 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:20,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:20,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:20,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:20,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:16:20,212 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 05:16:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash -642580294, now seen corresponding path program 1 times [2022-12-06 05:16:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:20,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696404023] [2022-12-06 05:16:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:20,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 05:16:20,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696404023] [2022-12-06 05:16:20,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696404023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:20,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:20,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132606840] [2022-12-06 05:16:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:20,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:20,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:20,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 05:16:20,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:20,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:20,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:20,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:20,684 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:20,694 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 05:16:20,704 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:20,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:20,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:20,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 05:16:20,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:20,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 05:16:20,752 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,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 05:16:20,752 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:20,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:20,753 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:20,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:20,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,788 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:20,788 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:16:20,790 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 05:16:20,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:20,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:20,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:20,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 05:16:20,977 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:20,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:20,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:20,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:20,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:16:20,977 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 05:16:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1100230041, now seen corresponding path program 1 times [2022-12-06 05:16:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:20,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918174705] [2022-12-06 05:16:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:21,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 05:16:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:21,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918174705] [2022-12-06 05:16:21,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918174705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:21,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:21,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694521006] [2022-12-06 05:16:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:21,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:21,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:21,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:21,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:21,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:21,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:21,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:21,384 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:21,394 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 05:16:21,405 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:21,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:21,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:21,407 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:21,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:21,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 05:16:21,444 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:21,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:21,444 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:21,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:21,445 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:21,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:21,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:21,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:21,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:21,478 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:21,478 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:16:21,480 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 05:16:21,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:21,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:21,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:21,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 05:16:21,684 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:21,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 05:16:21,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:21,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 05:16:21,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:16:21,684 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 05:16:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1451926920, now seen corresponding path program 1 times [2022-12-06 05:16:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:21,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168624133] [2022-12-06 05:16:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:21,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 05:16:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:21,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168624133] [2022-12-06 05:16:21,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168624133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:21,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:21,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723187671] [2022-12-06 05:16:21,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:21,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:21,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:21,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:21,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:21,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:21,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:21,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:22,082 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:22,082 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:16:22,097 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:22,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:22,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:22,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 05:16:22,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:22,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 05:16:22,135 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:22,135 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:22,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:22,135 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:22,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:22,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,162 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:22,162 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:16:22,164 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 05:16:22,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:22,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:22,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 05:16:22,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:22,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 05:16:22,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:22,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 05:16:22,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 05:16:22,345 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 05:16:22,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 290883415, now seen corresponding path program 1 times [2022-12-06 05:16:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:22,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49054641] [2022-12-06 05:16:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:22,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49054641] [2022-12-06 05:16:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49054641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:22,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238597179] [2022-12-06 05:16:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:22,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:22,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:22,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 05:16:22,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:22,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:22,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:22,775 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:22,775 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:22,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 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 05:16:22,789 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:22,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:22,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:22,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 05:16:22,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:22,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 05:16:22,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,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 05:16:22,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:22,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:22,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:22,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:22,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,850 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:22,850 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:22,851 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 05:16:22,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:22,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:22,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:22,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:16:22,998 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16: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 05:16:22,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:22,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 05:16:22,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 05:16:22,998 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 05:16:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2033693750, now seen corresponding path program 1 times [2022-12-06 05:16:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:22,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378523113] [2022-12-06 05:16:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:23,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 05:16:23,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:23,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378523113] [2022-12-06 05:16:23,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378523113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:23,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:23,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764918451] [2022-12-06 05:16:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:23,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:23,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:23,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:23,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 05:16:23,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:23,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:23,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:23,411 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:23,412 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:16:23,419 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 05:16:23,426 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:23,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:23,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:23,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 05:16:23,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:23,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 05:16:23,467 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:23,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:23,468 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:23,468 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:23,468 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:23,469 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:23,469 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:23,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:23,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:23,494 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:23,495 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:16:23,496 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 05:16:23,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:23,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:23,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:23,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 05:16:23,694 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:23,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:23,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:23,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:23,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 05:16:23,695 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 05:16:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash -518463211, now seen corresponding path program 1 times [2022-12-06 05:16:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:23,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681495331] [2022-12-06 05:16:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:23,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 05:16:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:23,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681495331] [2022-12-06 05:16:23,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681495331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:23,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:23,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548981227] [2022-12-06 05:16:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:23,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:23,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 05:16:23,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:23,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:23,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:24,162 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:24,162 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:24,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 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 05:16:24,176 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:24,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:24,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:24,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 05:16:24,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:24,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 05:16:24,212 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,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 05:16:24,212 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:24,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:24,212 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:24,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:24,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,241 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:24,241 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:16:24,242 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 05:16:24,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:24,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:24,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:16:24,393 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:24,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 05:16:24,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:24,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 05:16:24,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 05:16:24,394 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 05:16:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1224347124, now seen corresponding path program 1 times [2022-12-06 05:16:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:24,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065056521] [2022-12-06 05:16:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:24,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 05:16:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:24,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065056521] [2022-12-06 05:16:24,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065056521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:24,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:24,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590730424] [2022-12-06 05:16:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:24,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:24,492 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:24,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 05:16:24,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:24,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:24,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:24,814 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:24,815 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:24,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 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 05:16:24,828 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:24,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:24,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:24,829 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:24,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:24,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 05:16:24,860 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,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 05:16:24,861 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:24,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:24,861 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:24,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:24,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:24,893 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:16:24,895 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 05:16:24,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:24,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:25,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:25,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:16:25,061 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:25,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:25,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:25,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:25,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:16:25,062 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 05:16:25,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1327809837, now seen corresponding path program 1 times [2022-12-06 05:16:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:25,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94043356] [2022-12-06 05:16:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:25,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94043356] [2022-12-06 05:16:25,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94043356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:25,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:25,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564504192] [2022-12-06 05:16:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:25,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:25,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:25,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:25,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 05:16:25,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:25,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:25,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:25,470 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:25,470 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:25,478 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 05:16:25,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:25,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:25,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:25,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 05:16:25,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:25,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 05:16:25,529 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:25,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 05:16:25,529 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:25,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:25,529 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:25,530 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:25,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:25,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:25,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:25,555 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:25,556 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:16:25,557 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 05:16:25,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:25,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:25,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:25,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:16:25,711 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:25,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 05:16:25,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:25,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 05:16:25,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 05:16:25,712 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 05:16:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash 415000498, now seen corresponding path program 1 times [2022-12-06 05:16:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:25,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387279218] [2022-12-06 05:16:25,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:25,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 05:16:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:25,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387279218] [2022-12-06 05:16:25,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387279218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:25,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:25,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:25,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482716178] [2022-12-06 05:16:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:25,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:25,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:25,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:25,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:25,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:25,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 05:16:25,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:25,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:25,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:26,153 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:26,153 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:26,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 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 05:16:26,168 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:26,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:26,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:26,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 05:16:26,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:26,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 05:16:26,203 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,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 05:16:26,204 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:26,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:26,204 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:26,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:26,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,230 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:26,230 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:16:26,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 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 05:16:26,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:26,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:26,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:16:26,401 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:26,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:26,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:26,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 05:16:26,401 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 05:16:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2137156463, now seen corresponding path program 1 times [2022-12-06 05:16:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:26,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541784119] [2022-12-06 05:16:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:26,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541784119] [2022-12-06 05:16:26,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541784119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:26,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:26,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445319478] [2022-12-06 05:16:26,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:26,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:26,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:26,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 05:16:26,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:26,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:26,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:26,761 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:26,770 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 05:16:26,778 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:26,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:26,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:26,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 05:16:26,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:26,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 05:16:26,816 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:26,816 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:26,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:26,816 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:26,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:26,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,842 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:26,842 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:26,843 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 05:16:26,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:26,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:26,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:27,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:16:27,000 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:27,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:27,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:27,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:27,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 05:16:27,001 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 05:16:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash -394346128, now seen corresponding path program 1 times [2022-12-06 05:16:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:27,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807882602] [2022-12-06 05:16:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:27,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 05:16:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807882602] [2022-12-06 05:16:27,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807882602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:27,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:27,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996925207] [2022-12-06 05:16:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:27,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:27,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:27,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 05:16:27,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:27,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:27,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:27,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:27,468 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:27,475 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 05:16:27,483 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:27,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:27,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:27,484 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:27,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:27,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:27,519 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:27,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:27,519 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:27,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:27,519 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:27,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:27,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:27,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:27,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:27,546 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:27,546 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:27,547 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 05:16:27,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:27,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:27,701 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:27,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:16:27,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:27,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 05:16:27,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:27,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 05:16:27,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 05:16:27,702 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 05:16:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1348464207, now seen corresponding path program 1 times [2022-12-06 05:16:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:27,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614124822] [2022-12-06 05:16:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:27,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 05:16:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:27,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614124822] [2022-12-06 05:16:27,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614124822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:27,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:27,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473984055] [2022-12-06 05:16:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:27,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:27,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:27,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 05:16:27,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:27,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:27,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:28,092 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:28,092 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:28,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:28,113 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:28,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:28,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:28,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 05:16:28,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:28,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 05:16:28,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,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 05:16:28,149 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:28,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:28,149 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:28,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:28,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,174 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:28,174 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:16:28,175 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 05:16:28,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:28,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:28,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:16:28,325 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:28,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 05:16:28,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:28,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:28,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 05:16:28,326 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 05:16:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1203692754, now seen corresponding path program 1 times [2022-12-06 05:16:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:28,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551342236] [2022-12-06 05:16:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:28,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:28,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551342236] [2022-12-06 05:16:28,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551342236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:28,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:28,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127148972] [2022-12-06 05:16:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:28,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:28,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 05:16:28,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:28,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:28,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:28,718 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:28,719 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:28,726 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 05:16:28,734 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:28,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:28,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:28,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 05:16:28,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:28,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 05:16:28,767 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,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 05:16:28,768 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:28,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:28,768 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:28,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:28,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,793 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:28,793 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:16:28,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 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 05:16:28,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:28,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:28,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:28,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:16:28,949 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:28,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:28,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:28,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 05:16:28,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 05:16:28,950 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 05:16:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash 539117581, now seen corresponding path program 1 times [2022-12-06 05:16:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:28,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707808586] [2022-12-06 05:16:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:28,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:29,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 05:16:29,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:29,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707808586] [2022-12-06 05:16:29,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707808586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:29,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:29,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:29,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097288975] [2022-12-06 05:16:29,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:29,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:29,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:29,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:29,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:29,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:29,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:29,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:29,304 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:29,304 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:29,311 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 05:16:29,319 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:29,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:29,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:29,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 05:16:29,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:29,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 05:16:29,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16: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 05:16:29,353 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:29,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:29,353 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:29,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:29,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,389 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:29,389 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:16:29,390 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 05:16:29,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:29,529 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:29,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:16:29,530 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:29,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 05:16:29,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:29,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 05:16:29,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 05:16:29,530 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 05:16:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2013039380, now seen corresponding path program 1 times [2022-12-06 05:16:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908009959] [2022-12-06 05:16:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908009959] [2022-12-06 05:16:29,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908009959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:29,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:29,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693441211] [2022-12-06 05:16:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:29,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:29,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 05:16:29,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:29,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:29,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:29,901 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:29,901 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:29,911 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 05:16:29,922 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:29,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:29,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:29,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 05:16:29,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:29,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 05:16:29,969 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,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 05:16:29,970 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:29,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:29,970 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:29,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:29,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:29,998 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:29,998 INFO L131 PetriNetUnfolder]: For 3175/3318 co-relation queries the response was YES. [2022-12-06 05:16:29,999 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 05:16:30,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:30,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:30,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:30,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:16:30,144 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:30,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 05:16:30,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:30,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:30,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 05:16:30,145 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 05:16:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -270229045, now seen corresponding path program 1 times [2022-12-06 05:16:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768461750] [2022-12-06 05:16:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:30,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 05:16:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768461750] [2022-12-06 05:16:30,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768461750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:30,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:30,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658731861] [2022-12-06 05:16:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:30,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:30,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:30,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:30,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:30,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:30,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:30,515 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:30,515 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:30,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:16:30,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:30,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:30,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:30,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 05:16:30,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:30,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 05:16:30,566 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:30,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:30,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:30,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:30,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:30,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:30,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:30,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:30,602 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:30,602 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:16:30,603 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 05:16:30,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:30,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:30,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:30,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:16:30,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:30,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 05:16:30,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:30,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 05:16:30,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 05:16:30,756 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 05:16:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:30,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1472581290, now seen corresponding path program 1 times [2022-12-06 05:16:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595548785] [2022-12-06 05:16:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:30,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 05:16:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:30,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595548785] [2022-12-06 05:16:30,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595548785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:30,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:30,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630994602] [2022-12-06 05:16:30,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:30,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:30,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:30,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:30,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 05:16:30,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:30,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:30,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:31,112 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:31,113 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:31,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 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 05:16:31,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:31,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:31,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:31,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 05:16:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:31,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:31,163 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:31,164 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:31,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:31,164 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:31,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:31,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,189 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:31,190 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:16:31,191 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 05:16:31,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:31,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:31,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:16:31,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:31,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 05:16:31,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:31,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 05:16:31,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 05:16:31,340 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 05:16:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1079575671, now seen corresponding path program 1 times [2022-12-06 05:16:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:31,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028257227] [2022-12-06 05:16:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:31,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 05:16:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028257227] [2022-12-06 05:16:31,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028257227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:31,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:31,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:31,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794349274] [2022-12-06 05:16:31,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:31,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:31,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:31,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:31,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 05:16:31,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:31,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:31,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:31,724 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:31,724 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:31,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:31,736 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:31,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:31,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:31,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 05:16:31,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:31,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 05:16:31,768 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,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 05:16:31,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:31,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:31,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:31,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:31,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,799 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:31,799 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:16:31,800 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 05:16:31,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:31,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:31,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:31,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 05:16:31,972 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:31,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 05:16:31,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:31,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 05:16:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 05:16:31,973 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 05:16:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash 663234664, now seen corresponding path program 1 times [2022-12-06 05:16:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:31,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49379410] [2022-12-06 05:16:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:32,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 05:16:32,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:32,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49379410] [2022-12-06 05:16:32,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49379410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:32,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:32,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901470294] [2022-12-06 05:16:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:32,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:32,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:32,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 05:16:32,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:32,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:32,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:32,344 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:32,345 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:32,352 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 05:16:32,359 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:32,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:32,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:32,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 05:16:32,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:32,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 05:16:32,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:32,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 05:16:32,397 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:32,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:32,397 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:32,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:32,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:32,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:32,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:32,424 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:32,424 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:32,425 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 05:16:32,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:32,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:32,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:32,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:16:32,582 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16: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 05:16:32,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16: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 05:16:32,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 05:16:32,582 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 05:16:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:32,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1888922297, now seen corresponding path program 1 times [2022-12-06 05:16:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:32,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559802700] [2022-12-06 05:16:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:32,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559802700] [2022-12-06 05:16:32,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559802700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:32,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:32,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613209066] [2022-12-06 05:16:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:32,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:32,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:32,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:32,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:32,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:32,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:32,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:32,972 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:32,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:32,985 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:32,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:32,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:32,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 05:16:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:33,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:33,018 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:33,018 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:33,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:33,019 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:33,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:33,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,044 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:33,045 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:33,046 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 05:16:33,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:33,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:33,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:16:33,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:33,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 05:16:33,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:33,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 05:16:33,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 05:16:33,204 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 05:16:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -146111962, now seen corresponding path program 1 times [2022-12-06 05:16:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:33,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981822747] [2022-12-06 05:16:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:33,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981822747] [2022-12-06 05:16:33,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981822747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:33,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:33,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:33,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178084929] [2022-12-06 05:16:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:33,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:33,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:33,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:33,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:33,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:33,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:33,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:33,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:33,543 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:33,543 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:33,550 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 05:16:33,558 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:33,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:33,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:33,559 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:33,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:33,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 05:16:33,594 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,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 05:16:33,595 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:33,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:33,595 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:33,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:33,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,621 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:33,622 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:16:33,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 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 05:16:33,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:33,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:33,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:33,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:16:33,784 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:33,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 05:16:33,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:33,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 05:16:33,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 05:16:33,784 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 05:16:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1596698373, now seen corresponding path program 1 times [2022-12-06 05:16:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092211606] [2022-12-06 05:16:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:33,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092211606] [2022-12-06 05:16:33,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092211606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:33,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:33,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002913365] [2022-12-06 05:16:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:33,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:33,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:33,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:33,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:33,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:33,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:33,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:33,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:33,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:34,158 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:34,158 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:16:34,165 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 05:16:34,171 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:34,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:34,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:34,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 05:16:34,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:34,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 05:16:34,202 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,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 05:16:34,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:34,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:34,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:34,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:34,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,228 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:34,228 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:34,229 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 05:16:34,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:34,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:34,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:16:34,400 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:34,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 05:16:34,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:34,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:34,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 05:16:34,401 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 05:16:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash -955458588, now seen corresponding path program 1 times [2022-12-06 05:16:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:34,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528828416] [2022-12-06 05:16:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528828416] [2022-12-06 05:16:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528828416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:34,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:34,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504665571] [2022-12-06 05:16:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:34,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:34,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 05:16:34,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:34,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:34,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:34,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:34,763 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:16:34,771 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 05:16:34,778 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:34,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:34,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:34,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 05:16:34,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:34,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 05:16:34,815 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,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 05:16:34,815 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:34,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:34,815 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:34,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:34,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,841 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:34,841 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:16:34,842 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 05:16:34,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:34,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:34,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:34,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:16:34,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:34,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 05:16:34,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:34,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 05:16:34,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 05:16:34,998 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 05:16:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 787351747, now seen corresponding path program 1 times [2022-12-06 05:16:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:34,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376033653] [2022-12-06 05:16:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:35,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 05:16:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:35,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376033653] [2022-12-06 05:16:35,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376033653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:35,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:35,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:35,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087878103] [2022-12-06 05:16:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:35,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:35,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:35,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:35,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:35,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:35,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:35,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:35,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:35,369 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:35,369 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:35,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 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 05:16:35,384 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:35,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:35,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:35,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 05:16:35,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:35,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 05:16:35,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:35,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 05:16:35,419 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:35,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:35,419 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:35,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:35,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:35,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:35,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:35,445 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:35,445 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:16:35,447 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 05:16:35,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:35,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:35,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:35,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:16:35,624 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:35,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:35,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:35,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:35,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 05:16:35,625 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 05:16:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1764805214, now seen corresponding path program 1 times [2022-12-06 05:16:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807723801] [2022-12-06 05:16:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807723801] [2022-12-06 05:16:35,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807723801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:35,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:35,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499843645] [2022-12-06 05:16:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:35,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:35,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:35,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:35,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 05:16:35,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:35,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:35,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:36,039 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:36,040 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:36,050 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 05:16:36,060 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:36,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:36,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:36,061 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:36,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:36,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 05:16:36,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,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 05:16:36,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:36,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:36,095 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:36,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:36,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,122 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:36,123 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:16:36,124 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 05:16:36,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:36,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:36,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 05:16:36,298 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:36,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:36,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:36,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:36,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 05:16:36,298 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 05:16:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:36,299 INFO L85 PathProgramCache]: Analyzing trace with hash -21994879, now seen corresponding path program 1 times [2022-12-06 05:16:36,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:36,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823760913] [2022-12-06 05:16:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:36,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 05:16:36,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:36,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823760913] [2022-12-06 05:16:36,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823760913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:36,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:36,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703415557] [2022-12-06 05:16:36,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:36,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:36,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:36,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:36,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:36,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:36,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:36,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:36,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:36,717 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:36,717 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:36,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 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 05:16:36,733 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:36,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:36,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:36,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 05:16:36,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:36,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 05:16:36,768 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,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 05:16:36,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:36,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:36,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:36,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:36,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,799 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:36,799 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:36,800 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 05:16:36,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:36,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:36,964 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:36,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:16:36,965 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:36,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:36,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:36,965 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:36,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 05:16:36,966 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 05:16:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1720815456, now seen corresponding path program 1 times [2022-12-06 05:16:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:36,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333092015] [2022-12-06 05:16:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:37,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 05:16:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:37,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333092015] [2022-12-06 05:16:37,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333092015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:37,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:37,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831080264] [2022-12-06 05:16:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:37,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:37,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:37,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:37,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 05:16:37,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:37,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:37,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:37,394 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:37,394 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:37,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 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 05:16:37,415 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:37,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:37,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:37,416 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:37,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:37,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 05:16:37,460 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:37,460 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:37,461 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:37,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:37,461 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:37,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:37,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:37,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:37,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:37,487 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:37,488 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:16:37,489 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 05:16:37,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:37,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:37,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:37,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:16:37,638 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:37,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 05:16:37,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:37,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 05:16:37,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 05:16:37,638 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 05:16:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:37,638 INFO L85 PathProgramCache]: Analyzing trace with hash -831341505, now seen corresponding path program 1 times [2022-12-06 05:16:37,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:37,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927146129] [2022-12-06 05:16:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:37,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927146129] [2022-12-06 05:16:37,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927146129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:37,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:37,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531271488] [2022-12-06 05:16:37,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:37,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:37,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:37,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 05:16:37,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:37,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:37,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:37,988 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:37,989 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:37,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 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 05:16:38,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:38,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:38,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:38,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 05:16:38,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:38,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 05:16:38,041 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,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 05:16:38,041 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:38,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:38,041 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:38,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:38,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,067 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:38,067 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:38,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 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 05:16:38,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:38,214 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:38,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:16:38,215 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:38,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 05:16:38,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:38,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:38,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 05:16:38,216 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 05:16:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash 911468830, now seen corresponding path program 1 times [2022-12-06 05:16:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:38,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255780705] [2022-12-06 05:16:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:38,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:38,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 05:16:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:38,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255780705] [2022-12-06 05:16:38,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255780705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:38,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:38,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149316983] [2022-12-06 05:16:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:38,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:38,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:38,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:38,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:38,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 05:16:38,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:38,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:38,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:38,570 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:38,570 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:16:38,586 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:38,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:38,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:38,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 05:16:38,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:38,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 05:16:38,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,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 05:16:38,622 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:38,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:38,623 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:38,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:38,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,651 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:38,651 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:16:38,653 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 05:16:38,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:38,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:38,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:38,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:16:38,817 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:38,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:38,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:38,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:38,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 05:16:38,817 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 05:16:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1640688131, now seen corresponding path program 1 times [2022-12-06 05:16:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755112608] [2022-12-06 05:16:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:38,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:38,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755112608] [2022-12-06 05:16:38,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755112608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:38,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:38,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:38,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054016746] [2022-12-06 05:16:38,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:38,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:38,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:38,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:38,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:38,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:38,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:38,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:39,166 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:39,166 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:39,174 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 05:16:39,182 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:39,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:39,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:39,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 05:16:39,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:39,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 05:16:39,216 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,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 05:16:39,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:39,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:39,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:39,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:39,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,246 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:39,246 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:16:39,247 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 05:16:39,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:39,399 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:39,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:16:39,400 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:39,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 05:16:39,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:39,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 05:16:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 05:16:39,400 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 05:16:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 102122204, now seen corresponding path program 1 times [2022-12-06 05:16:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:39,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181589103] [2022-12-06 05:16:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:39,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 05:16:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:39,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181589103] [2022-12-06 05:16:39,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181589103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:39,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:39,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312068381] [2022-12-06 05:16:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:39,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:39,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:39,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 05:16:39,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:39,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:39,869 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:39,869 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:39,880 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 05:16:39,892 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:39,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:39,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:39,893 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:39,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:39,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 05:16:39,934 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:39,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:39,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:39,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:39,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:39,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,960 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:39,961 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:39,962 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 05:16:39,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:39,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:40,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:40,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:16:40,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:40,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 05:16:40,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:40,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 05:16:40,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 05:16:40,116 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 05:16:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:40,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1844932539, now seen corresponding path program 1 times [2022-12-06 05:16:40,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:40,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532940944] [2022-12-06 05:16:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:40,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 05:16:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:40,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532940944] [2022-12-06 05:16:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532940944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:40,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:40,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243695797] [2022-12-06 05:16:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:40,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:40,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:40,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 05:16:40,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:40,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:40,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:40,474 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:40,475 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:40,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 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 05:16:40,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:40,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:40,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:40,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 05:16:40,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:40,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:40,527 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:40,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 05:16:40,528 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:40,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:40,528 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:40,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:40,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:40,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:40,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:40,564 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:40,564 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:40,566 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 05:16:40,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:40,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:40,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:40,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:16:40,711 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:40,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 05:16:40,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:40,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 05:16:40,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 05:16:40,711 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 05:16:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:40,711 INFO L85 PathProgramCache]: Analyzing trace with hash -707224422, now seen corresponding path program 1 times [2022-12-06 05:16:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:40,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009093829] [2022-12-06 05:16:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:40,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:40,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009093829] [2022-12-06 05:16:40,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009093829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:40,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:40,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176594314] [2022-12-06 05:16:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:40,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:40,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:40,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:40,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:40,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:41,157 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:41,158 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:41,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 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 05:16:41,179 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:41,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:41,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:41,180 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:41,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:41,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 05:16:41,229 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:41,229 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:41,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:41,230 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:41,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:41,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,273 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:41,273 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:16:41,275 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 05:16:41,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:41,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:41,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 05:16:41,452 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:41,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:41,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:41,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:41,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 05:16:41,452 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 05:16:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1035585913, now seen corresponding path program 1 times [2022-12-06 05:16:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:41,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436808124] [2022-12-06 05:16:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:41,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 05:16:41,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:41,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436808124] [2022-12-06 05:16:41,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436808124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:41,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:41,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:41,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195242124] [2022-12-06 05:16:41,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:41,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:41,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:41,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:41,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:41,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:41,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 05:16:41,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:41,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:41,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:41,811 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:41,811 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:41,818 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 05:16:41,825 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:41,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:41,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:41,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 05:16:41,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:41,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 05:16:41,858 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:41,859 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:41,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:41,859 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:41,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:41,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,884 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:41,884 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:41,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 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 05:16:41,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:41,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:42,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:42,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:16:42,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:42,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 05:16:42,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:42,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 05:16:42,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 05:16:42,028 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 05:16:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1516571048, now seen corresponding path program 1 times [2022-12-06 05:16:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:42,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426860474] [2022-12-06 05:16:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:42,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 05:16:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:42,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426860474] [2022-12-06 05:16:42,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426860474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:42,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:42,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446210289] [2022-12-06 05:16:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:42,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:42,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:42,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:42,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 05:16:42,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:42,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:42,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:42,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:42,445 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:42,452 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 05:16:42,461 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:42,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:42,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:42,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 05:16:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:42,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 05:16:42,524 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:42,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 05:16:42,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:42,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:42,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:42,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:42,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:42,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:42,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:42,559 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:42,559 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:42,560 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 05:16:42,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:42,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:42,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:42,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:16:42,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:42,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 05:16:42,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:42,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 05:16:42,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 05:16:42,709 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 05:16:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 226239287, now seen corresponding path program 1 times [2022-12-06 05:16:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178892658] [2022-12-06 05:16:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:42,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 05:16:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178892658] [2022-12-06 05:16:42,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178892658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:42,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:42,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547241904] [2022-12-06 05:16:42,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:42,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:42,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:42,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:42,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:42,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:42,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:42,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:43,156 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:43,156 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:16:43,166 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 05:16:43,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:43,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:43,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:43,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 05:16:43,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:43,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 05:16:43,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,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 05:16:43,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:43,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:43,222 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:43,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:43,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,247 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:43,247 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:16:43,248 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 05:16:43,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:43,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:43,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:16:43,399 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:43,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:43,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:43,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 05:16:43,399 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 05:16:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1969049622, now seen corresponding path program 1 times [2022-12-06 05:16:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:43,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42921904] [2022-12-06 05:16:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:43,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:43,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42921904] [2022-12-06 05:16:43,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42921904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:43,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:43,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223490746] [2022-12-06 05:16:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:43,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:43,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:43,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:43,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 05:16:43,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:43,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:43,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:43,770 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:43,770 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:43,776 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 05:16:43,782 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:43,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:43,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:43,783 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:43,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:43,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 05:16:43,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,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 05:16:43,812 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:43,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:43,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:43,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:43,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,838 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:43,838 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:16:43,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 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 05:16:43,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:43,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:43,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:43,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:16:43,984 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:43,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 05:16:43,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:43,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 05:16:43,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 05:16:43,985 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 05:16:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -583107339, now seen corresponding path program 1 times [2022-12-06 05:16:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:43,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620073625] [2022-12-06 05:16:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:44,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620073625] [2022-12-06 05:16:44,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620073625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:44,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:44,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435869705] [2022-12-06 05:16:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:44,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:44,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:44,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:44,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:44,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:44,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:44,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:44,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:44,341 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:44,342 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:44,352 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 05:16:44,362 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:44,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:44,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:44,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 05:16:44,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:44,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 05:16:44,408 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:44,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 05:16:44,408 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:44,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:44,408 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:44,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:44,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:44,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:44,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:44,434 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:44,434 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:44,435 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 05:16:44,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:44,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:44,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:44,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:16:44,583 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:44,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:44,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:44,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:44,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 05:16:44,583 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 05:16:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1159702996, now seen corresponding path program 1 times [2022-12-06 05:16:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:44,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252969435] [2022-12-06 05:16:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:44,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:44,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252969435] [2022-12-06 05:16:44,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252969435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:44,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:44,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303167590] [2022-12-06 05:16:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:44,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:44,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:44,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 05:16:44,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:44,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:44,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:45,010 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:45,011 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:45,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 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 05:16:45,026 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:45,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:45,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:45,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 05:16:45,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:45,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 05:16:45,062 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,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 05:16:45,062 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:45,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:45,062 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:45,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:45,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,093 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:45,094 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:16:45,095 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 05:16:45,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:45,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:45,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 05:16:45,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:45,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 05:16:45,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:45,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 05:16:45,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 05:16:45,266 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 05:16:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1392453965, now seen corresponding path program 1 times [2022-12-06 05:16:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:45,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595801214] [2022-12-06 05:16:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595801214] [2022-12-06 05:16:45,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595801214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:45,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:45,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488435568] [2022-12-06 05:16:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:45,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:45,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:45,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 05:16:45,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:45,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:45,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:45,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:45,667 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:45,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 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 05:16:45,681 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:45,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:45,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:45,683 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:45,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:45,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 05:16:45,718 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,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 05:16:45,718 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:45,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:45,719 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:45,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:45,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,744 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:45,744 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:16:45,745 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 05:16:45,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:45,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:45,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:45,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:16:45,893 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16: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 05:16:45,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:45,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 05:16:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 05:16:45,894 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 05:16:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash 350356370, now seen corresponding path program 1 times [2022-12-06 05:16:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:45,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713552801] [2022-12-06 05:16:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:45,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 05:16:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713552801] [2022-12-06 05:16:45,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713552801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:45,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418871666] [2022-12-06 05:16:45,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:45,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:45,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 05:16:45,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:45,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:46,306 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:46,306 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:46,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 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 05:16:46,318 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:46,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:46,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:46,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 05:16:46,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:46,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:46,348 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:46,348 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:46,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:46,349 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:46,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:46,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,374 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:46,374 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:16:46,375 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 05:16:46,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:46,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:46,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:16:46,529 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:46,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 05:16:46,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:46,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:46,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 05:16:46,529 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 05:16:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2093166705, now seen corresponding path program 1 times [2022-12-06 05:16:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:46,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503810339] [2022-12-06 05:16:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:46,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 05:16:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:46,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503810339] [2022-12-06 05:16:46,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503810339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:46,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:46,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453313898] [2022-12-06 05:16:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:46,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:46,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:46,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:46,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:46,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:46,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:46,880 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:46,880 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:46,888 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 05:16:46,896 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:46,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:46,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:46,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 05:16:46,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:46,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 05:16:46,931 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:46,931 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:46,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:46,931 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:46,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:46,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,958 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:46,959 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:16:46,960 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 05:16:46,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:46,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:47,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:47,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:16:47,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:47,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 05:16:47,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:47,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:47,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 05:16:47,117 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 05:16:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:47,117 INFO L85 PathProgramCache]: Analyzing trace with hash -458990256, now seen corresponding path program 1 times [2022-12-06 05:16:47,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:47,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148433215] [2022-12-06 05:16:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:47,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 05:16:47,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:47,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148433215] [2022-12-06 05:16:47,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148433215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:47,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:47,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491401823] [2022-12-06 05:16:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:47,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:47,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:47,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:47,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:47,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 05:16:47,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:47,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:47,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:47,452 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:47,452 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:47,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:47,467 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:47,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:47,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:47,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 05:16:47,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:47,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 05:16:47,504 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:47,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:47,505 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:47,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:47,505 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:47,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:47,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:47,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:47,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:47,530 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:47,530 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:16:47,531 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 05:16:47,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:47,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:47,688 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:47,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:16:47,689 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:47,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 05:16:47,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:47,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 05:16:47,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 05:16:47,689 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 05:16:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1283820079, now seen corresponding path program 1 times [2022-12-06 05:16:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:47,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485844044] [2022-12-06 05:16:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:47,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 05:16:47,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:47,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485844044] [2022-12-06 05:16:47,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485844044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:47,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:47,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579575199] [2022-12-06 05:16:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:47,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:47,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:47,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 05:16:47,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:47,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:47,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:48,019 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:48,019 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:48,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 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 05:16:48,033 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:48,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:48,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:48,034 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:48,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:48,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:48,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,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 05:16:48,073 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:48,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:48,073 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:48,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:48,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,110 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:48,110 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:48,112 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 05:16:48,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:48,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:48,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:16:48,257 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:48,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 05:16:48,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:48,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 05:16:48,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 05:16:48,257 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 05:16:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1268336882, now seen corresponding path program 1 times [2022-12-06 05:16:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646184948] [2022-12-06 05:16:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:48,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646184948] [2022-12-06 05:16:48,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646184948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:48,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:48,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007270859] [2022-12-06 05:16:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:48,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:48,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:48,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:48,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:48,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 05:16:48,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:48,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:48,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:48,643 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:48,643 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:48,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 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 05:16:48,660 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:48,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:48,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:48,661 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:48,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:48,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 05:16:48,697 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,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 05:16:48,697 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:48,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:48,697 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:48,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:48,698 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,724 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:48,724 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:48,725 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 05:16:48,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:48,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:48,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:48,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:16:48,873 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:48,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 05:16:48,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:48,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:48,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 05:16:48,874 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 05:16:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 474473453, now seen corresponding path program 1 times [2022-12-06 05:16:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201036141] [2022-12-06 05:16:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:48,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 05:16:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:48,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201036141] [2022-12-06 05:16:48,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201036141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:48,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:48,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144482787] [2022-12-06 05:16:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:48,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:48,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:48,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:48,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:48,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:49,238 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:49,238 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:49,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:49,254 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:49,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:49,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:49,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 05:16:49,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:49,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 05:16:49,288 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,288 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:49,288 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:49,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:49,288 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:49,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:49,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,314 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:49,314 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:49,315 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 05:16:49,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:49,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:49,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:16:49,468 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:49,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:49,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-06 05:16:49,468 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 05:16:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2077683508, now seen corresponding path program 1 times [2022-12-06 05:16:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:49,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088511401] [2022-12-06 05:16:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:49,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088511401] [2022-12-06 05:16:49,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088511401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:49,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:49,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649620419] [2022-12-06 05:16:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:49,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:49,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:49,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:49,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:49,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 05:16:49,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:49,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:49,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:49,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:49,827 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:49,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:16:49,841 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:49,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:49,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:49,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 05:16:49,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:49,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 05:16:49,876 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,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 05:16:49,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:49,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:49,877 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:49,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:49,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,905 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:49,906 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:16:49,907 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 05:16:49,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:49,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:50,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:50,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:16:50,057 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:50,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 05:16:50,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:50,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 05:16:50,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 05:16:50,057 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 05:16:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash -334873173, now seen corresponding path program 1 times [2022-12-06 05:16:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:50,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737843139] [2022-12-06 05:16:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:50,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 05:16:50,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737843139] [2022-12-06 05:16:50,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737843139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:50,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:50,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159449222] [2022-12-06 05:16:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:50,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:50,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:50,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:50,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 05:16:50,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:50,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:50,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:50,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:50,421 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:50,427 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 05:16:50,434 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:50,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:50,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:50,435 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:50,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 05:16:50,465 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:50,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 05:16:50,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:50,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:50,466 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:50,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:50,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:50,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:50,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:50,493 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:50,493 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:16:50,494 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 05:16:50,496 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:50,496 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:50,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:50,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:16:50,659 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:50,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 05:16:50,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:50,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 05:16:50,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 05:16:50,659 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 05:16:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1407937162, now seen corresponding path program 1 times [2022-12-06 05:16:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807812302] [2022-12-06 05:16:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:50,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807812302] [2022-12-06 05:16:50,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807812302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:50,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:50,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919898981] [2022-12-06 05:16:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:50,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:50,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:50,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:50,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:50,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:50,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:50,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:51,042 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:51,043 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:51,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:16:51,057 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:51,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:51,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:51,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 05:16:51,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:51,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 05:16:51,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,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 05:16:51,095 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:51,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:51,095 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:51,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:51,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,126 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:51,126 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:16:51,127 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 05:16:51,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:51,283 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:51,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:16:51,284 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:51,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 05:16:51,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:51,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 05:16:51,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 05:16:51,284 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 05:16:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1144219799, now seen corresponding path program 1 times [2022-12-06 05:16:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:51,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181092507] [2022-12-06 05:16:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:51,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181092507] [2022-12-06 05:16:51,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181092507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:51,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:51,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12307554] [2022-12-06 05:16:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:51,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:51,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:51,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 05:16:51,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:51,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:51,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:51,646 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:51,647 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:16:51,657 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 05:16:51,667 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:51,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:51,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:51,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 05:16:51,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:51,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 05:16:51,765 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,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 05:16:51,766 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:51,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:51,766 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:51,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:51,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,800 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:51,800 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:16:51,802 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 05:16:51,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:51,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:51,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:51,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:16:51,965 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:51,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:51,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:51,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 05:16:51,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 05:16:51,966 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 05:16:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash 598590536, now seen corresponding path program 1 times [2022-12-06 05:16:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:51,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030564373] [2022-12-06 05:16:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:52,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:52,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030564373] [2022-12-06 05:16:52,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030564373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:52,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:52,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169291417] [2022-12-06 05:16:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:52,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:52,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:52,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:52,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:52,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:52,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:52,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:52,308 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:52,308 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:52,315 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 05:16:52,322 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:52,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:52,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:52,323 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:52,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 05:16:52,361 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:52,361 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:52,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:52,362 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:52,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:52,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,387 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:52,387 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:16:52,389 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 05:16:52,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:52,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:52,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:16:52,538 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:52,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:52,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:52,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:52,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 05:16:52,538 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 05:16:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1953566425, now seen corresponding path program 1 times [2022-12-06 05:16:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:52,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446719471] [2022-12-06 05:16:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:52,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446719471] [2022-12-06 05:16:52,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446719471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:52,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:52,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590204566] [2022-12-06 05:16:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:52,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:52,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:52,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:52,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:52,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:52,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:52,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:52,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:52,891 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:52,892 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:16:52,899 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 05:16:52,908 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:52,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:52,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:52,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 05:16:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16: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 05:16:52,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16: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 05:16:52,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:52,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:52,946 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:52,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:52,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,973 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:52,973 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:16:52,974 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 05:16:52,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:52,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:53,145 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:53,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:16:53,146 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:53,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:53,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:53,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:53,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-06 05:16:53,146 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 05:16:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash -210756090, now seen corresponding path program 1 times [2022-12-06 05:16:53,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:53,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253491792] [2022-12-06 05:16:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:53,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 05:16:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:53,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253491792] [2022-12-06 05:16:53,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253491792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:53,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:53,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841957779] [2022-12-06 05:16:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:53,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:53,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:53,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:53,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:53,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:53,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:53,525 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:53,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 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 05:16:53,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:53,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:53,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:53,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 05:16:53,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:53,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 05:16:53,575 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:53,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 05:16:53,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:53,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:53,575 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:53,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:53,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:53,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:53,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:53,601 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:53,601 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:53,602 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 05:16:53,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:53,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:53,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:53,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:16:53,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:53,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 05:16:53,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:53,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 05:16:53,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-06 05:16:53,744 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 05:16:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1532054245, now seen corresponding path program 1 times [2022-12-06 05:16:53,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:53,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350061119] [2022-12-06 05:16:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:53,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 05:16:53,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:53,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350061119] [2022-12-06 05:16:53,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350061119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:53,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:53,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438342781] [2022-12-06 05:16:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:53,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:53,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:53,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:53,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 05:16:53,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:53,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:53,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:54,125 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:54,126 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16: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 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 05:16:54,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:54,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:54,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16: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 05:16:54,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:54,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 05:16:54,174 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,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 05:16:54,175 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:54,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:54,175 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:54,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:54,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,200 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:54,200 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:54,201 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 05:16:54,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:54,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:54,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:16:54,347 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:54,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 05:16:54,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:54,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 05:16:54,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-06 05:16:54,347 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 05:16:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1020102716, now seen corresponding path program 1 times [2022-12-06 05:16:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566592977] [2022-12-06 05:16:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:54,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566592977] [2022-12-06 05:16:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566592977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:54,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721010433] [2022-12-06 05:16:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:54,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:54,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:54,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 05:16:54,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:54,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:54,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:54,775 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:54,775 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:54,782 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 05:16:54,789 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:54,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:54,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:54,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 05:16:54,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16: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 05:16:54,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16: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 05:16:54,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:54,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:54,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:54,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:54,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,848 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:54,848 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:54,849 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 05:16:54,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:54,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:55,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:55,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:16:55,016 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:55,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 05:16:55,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:55,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 05:16:55,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-06 05:16:55,016 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 05:16:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 722707619, now seen corresponding path program 1 times [2022-12-06 05:16:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:55,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672534221] [2022-12-06 05:16:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:55,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 05:16:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:55,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672534221] [2022-12-06 05:16:55,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672534221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:55,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:55,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468130105] [2022-12-06 05:16:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:55,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:55,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:55,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:55,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 05:16:55,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:55,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:55,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:55,350 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:55,350 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:16:55,361 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 05:16:55,370 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:55,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:55,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:55,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:55,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:55,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 05:16:55,406 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:55,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 05:16:55,407 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:55,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:55,407 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:55,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:55,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:55,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:55,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:55,432 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:55,432 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:16:55,433 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 05:16:55,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:55,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:55,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:55,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:16:55,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:55,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 05:16:55,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:55,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 05:16:55,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-06 05:16:55,587 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 05:16:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1829449342, now seen corresponding path program 1 times [2022-12-06 05:16:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:55,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471956496] [2022-12-06 05:16:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:55,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:55,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471956496] [2022-12-06 05:16:55,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471956496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:55,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:55,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472364024] [2022-12-06 05:16:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:55,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:55,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:55,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:55,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 05:16:55,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:55,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:55,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:55,986 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:55,986 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:55,992 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 05:16:55,998 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:55,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:55,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:55,999 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:16:55,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:56,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:56,028 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:56,028 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:56,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:56,029 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:56,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:56,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,053 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:56,053 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:16:56,054 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 05:16:56,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:56,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:56,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 05:16:56,234 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:56,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 05:16:56,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:56,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 05:16:56,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-06 05:16:56,235 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 05:16:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash -86639007, now seen corresponding path program 1 times [2022-12-06 05:16:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:56,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400470709] [2022-12-06 05:16:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:56,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 05:16:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:56,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400470709] [2022-12-06 05:16:56,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400470709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:56,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:56,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991422784] [2022-12-06 05:16:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:56,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:56,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:56,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:56,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:56,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:56,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 05:16:56,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:56,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:56,564 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:56,564 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:16:56,572 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 05:16:56,579 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:56,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:56,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:56,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 05:16:56,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:56,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 05:16:56,615 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,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 05:16:56,615 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:56,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:56,615 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:56,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:56,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,643 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:56,644 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:16:56,645 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 05:16:56,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:56,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:56,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:56,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:16:56,804 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:56,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 05:16:56,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:56,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 05:16:56,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 05:16:56,804 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 05:16:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1656171328, now seen corresponding path program 1 times [2022-12-06 05:16:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:56,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853798019] [2022-12-06 05:16:56,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:56,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 05:16:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:56,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853798019] [2022-12-06 05:16:56,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853798019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:56,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:56,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165128826] [2022-12-06 05:16:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:56,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:56,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:56,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:56,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:56,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:56,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:57,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:57,168 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:57,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 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 05:16:57,182 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:57,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:57,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:57,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 05:16:57,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:57,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 05:16:57,218 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:16:57,218 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:57,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:57,218 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:57,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:57,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,249 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:57,249 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:16:57,250 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 05:16:57,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:57,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:57,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:16:57,398 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:57,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 05:16:57,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:57,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 05:16:57,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-06 05:16:57,398 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 05:16:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -895985633, now seen corresponding path program 1 times [2022-12-06 05:16:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500206338] [2022-12-06 05:16:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:57,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 05:16:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500206338] [2022-12-06 05:16:57,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500206338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:57,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:57,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:57,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25293693] [2022-12-06 05:16:57,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:57,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:57,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:57,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:57,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:57,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 05:16:57,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:57,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:57,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:57,740 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:57,740 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:16:57,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 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 05:16:57,755 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:57,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:57,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:57,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 05:16:57,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:57,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 05:16:57,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,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 05:16:57,792 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:57,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:57,792 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:57,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:57,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:57,818 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:16:57,819 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 05:16:57,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:57,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:57,960 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:57,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:16:57,960 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:57,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 05:16:57,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:57,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 05:16:57,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-06 05:16:57,961 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 05:16:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 846824702, now seen corresponding path program 1 times [2022-12-06 05:16:57,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:57,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602403036] [2022-12-06 05:16:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:58,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 05:16:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:58,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602403036] [2022-12-06 05:16:58,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602403036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:58,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:58,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342369032] [2022-12-06 05:16:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:58,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:58,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:58,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:58,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:58,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:58,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:58,332 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:58,332 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:16:58,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 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 05:16:58,347 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:58,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:58,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:58,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 05:16:58,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:58,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 05:16:58,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,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 05:16:58,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:58,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:58,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:58,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:58,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,405 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:16:58,405 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:16:58,406 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 05:16:58,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:58,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:58,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:16:58,559 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:58,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:58,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:58,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:58,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-06 05:16:58,559 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 05:16:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1705332259, now seen corresponding path program 1 times [2022-12-06 05:16:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:58,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140552579] [2022-12-06 05:16:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:58,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 05:16:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:58,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140552579] [2022-12-06 05:16:58,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140552579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:58,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:58,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626476887] [2022-12-06 05:16:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:58,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:58,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:58,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:58,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 05:16:58,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:58,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:58,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:58,901 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:58,901 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:16:58,908 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 05:16:58,915 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:58,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:58,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:58,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 05:16:58,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:58,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 05:16:58,949 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,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 05:16:58,949 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:58,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:58,950 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:58,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:58,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,975 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:58,975 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:16:58,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 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 05:16:58,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:58,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:59,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:59,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:16:59,136 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:59,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:59,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:59,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:59,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-06 05:16:59,137 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 05:16:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash 37478076, now seen corresponding path program 1 times [2022-12-06 05:16:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:59,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217560746] [2022-12-06 05:16:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:59,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:59,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217560746] [2022-12-06 05:16:59,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217560746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:59,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:59,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591466157] [2022-12-06 05:16:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:59,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:59,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:59,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:59,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:59,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:59,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:59,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:59,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:59,487 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:16:59,487 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:16:59,494 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 05:16:59,501 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:16:59,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:16:59,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:16:59,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 05:16:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:16:59,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 05:16:59,538 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:59,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 05:16:59,538 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:16:59,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:59,538 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:59,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:59,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:59,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:59,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:59,574 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:16:59,574 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:16:59,576 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 05:16:59,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:16:59,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:16:59,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:59,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:16:59,730 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:16:59,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 05:16:59,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:59,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 05:16:59,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-06 05:16:59,730 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 05:16:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1780288411, now seen corresponding path program 1 times [2022-12-06 05:16:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:59,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618651243] [2022-12-06 05:16:59,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:59,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618651243] [2022-12-06 05:16:59,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618651243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:59,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:59,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817309427] [2022-12-06 05:16:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:59,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:59,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:59,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:59,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:59,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 05:16:59,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:59,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:59,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:00,088 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:00,088 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:00,095 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 05:17:00,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:00,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:00,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:00,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 05:17:00,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:00,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 05:17:00,135 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:00,135 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:00,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:00,135 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:00,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:00,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,160 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:00,160 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:00,161 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 05:17:00,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:00,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:00,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:17:00,331 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:00,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 05:17:00,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:00,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 05:17:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 05:17:00,331 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 05:17:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash -771868550, now seen corresponding path program 1 times [2022-12-06 05:17:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099569009] [2022-12-06 05:17:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:00,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099569009] [2022-12-06 05:17:00,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099569009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:00,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:00,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597769885] [2022-12-06 05:17:00,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:00,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:00,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:00,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:00,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:00,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:00,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:00,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:00,671 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:00,671 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:00,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:00,685 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:00,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:00,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:00,686 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:00,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:00,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 05:17:00,718 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,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 05:17:00,718 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:00,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:00,719 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:00,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:00,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,744 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:00,744 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:00,746 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 05:17:00,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:00,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:00,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:00,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:00,900 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:00,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:00,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:00,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 05:17:00,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-06 05:17:00,900 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 05:17:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash 970941785, now seen corresponding path program 1 times [2022-12-06 05:17:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455420840] [2022-12-06 05:17:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:00,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455420840] [2022-12-06 05:17:00,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455420840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:00,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:00,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152920163] [2022-12-06 05:17:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:00,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:00,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 05:17:00,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:00,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:00,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:01,260 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:01,260 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:01,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 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 05:17:01,272 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:01,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:01,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:01,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 05:17:01,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:01,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:01,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,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 05:17:01,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:01,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:01,306 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:01,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:01,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,333 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:01,333 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:17:01,334 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 05:17:01,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:01,525 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:01,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 05:17:01,526 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:01,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 05:17:01,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:01,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 05:17:01,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-06 05:17:01,526 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 05:17:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1581215176, now seen corresponding path program 1 times [2022-12-06 05:17:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:01,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155792281] [2022-12-06 05:17:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:01,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 05:17:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:01,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155792281] [2022-12-06 05:17:01,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155792281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:01,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:01,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351842344] [2022-12-06 05:17:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:01,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:01,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:01,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:01,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:01,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:01,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:01,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:01,902 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:01,902 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:01,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:01,916 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:01,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:01,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:01,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 05:17:01,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:01,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 05:17:01,952 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,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 05:17:01,952 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:01,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:01,952 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:01,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:01,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,979 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:01,979 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:17:01,981 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 05:17:01,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:01,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:02,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:02,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 05:17:02,171 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:02,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:02,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:02,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:02,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-06 05:17:02,172 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 05:17:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 161595159, now seen corresponding path program 1 times [2022-12-06 05:17:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:02,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514174454] [2022-12-06 05:17:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:02,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 05:17:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514174454] [2022-12-06 05:17:02,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514174454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:02,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:02,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759065264] [2022-12-06 05:17:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:02,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:02,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:02,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:02,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:02,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:02,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:02,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:02,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:02,516 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:02,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 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 05:17:02,531 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:02,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:02,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:02,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 05:17:02,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:02,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 05:17:02,568 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:02,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 05:17:02,568 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:02,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:02,568 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:02,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:02,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:02,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:02,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:02,599 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:02,599 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:17:02,600 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 05:17:02,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:02,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:02,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:02,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:02,744 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:02,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 05:17:02,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:02,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 05:17:02,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-06 05:17:02,744 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 05:17:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1904405494, now seen corresponding path program 1 times [2022-12-06 05:17:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:02,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010158682] [2022-12-06 05:17:02,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:02,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 05:17:02,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:02,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010158682] [2022-12-06 05:17:02,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010158682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:02,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:02,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:02,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233798648] [2022-12-06 05:17:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:02,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:02,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:02,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:02,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:02,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:02,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:02,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:03,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:03,097 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:03,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:03,115 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:03,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:03,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:03,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 05:17:03,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:03,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 05:17:03,158 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,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 05:17:03,158 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:03,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:03,159 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:03,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:03,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,184 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:03,184 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:03,185 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 05:17:03,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:03,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:03,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:03,337 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:03,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 05:17:03,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:03,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 05:17:03,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-06 05:17:03,338 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 05:17:03,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash -647751467, now seen corresponding path program 1 times [2022-12-06 05:17:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:03,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562108502] [2022-12-06 05:17:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:03,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 05:17:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:03,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562108502] [2022-12-06 05:17:03,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562108502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:03,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:03,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761679614] [2022-12-06 05:17:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:03,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:03,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:03,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:03,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:03,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 05:17:03,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:03,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:03,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:03,689 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:03,690 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:17:03,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 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 05:17:03,707 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:03,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:03,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:03,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 05:17:03,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:03,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:03,749 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:03,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:03,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:03,750 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:03,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:03,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,775 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:03,775 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:03,776 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 05:17:03,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:03,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:03,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:03,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 05:17:03,952 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:03,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:03,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:03,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:03,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-06 05:17:03,952 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 05:17:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1095058868, now seen corresponding path program 1 times [2022-12-06 05:17:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:03,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032015966] [2022-12-06 05:17:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:04,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 05:17:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:04,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032015966] [2022-12-06 05:17:04,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032015966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:04,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:04,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570810456] [2022-12-06 05:17:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:04,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:04,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:04,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:04,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:04,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:04,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:04,288 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:04,288 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:17:04,295 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 05:17:04,302 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:04,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:04,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:04,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 05:17:04,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:04,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 05:17:04,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,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 05:17:04,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:04,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:04,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:04,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:04,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,374 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:04,375 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:17:04,376 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 05:17:04,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:04,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:04,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 05:17:04,546 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:04,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 05:17:04,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:04,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 05:17:04,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-06 05:17:04,547 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 05:17:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1457098093, now seen corresponding path program 1 times [2022-12-06 05:17:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:04,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781796439] [2022-12-06 05:17:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:04,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781796439] [2022-12-06 05:17:04,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781796439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:04,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:04,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896645888] [2022-12-06 05:17:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:04,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:04,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:04,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:04,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:04,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:04,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:04,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:04,895 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:04,896 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:17:04,903 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 05:17:04,911 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:04,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:04,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:04,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 05:17:04,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:04,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 05:17:04,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,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 05:17:04,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:04,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:04,947 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:04,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:04,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,971 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:04,972 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:04,973 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 05:17:04,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:04,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:05,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:05,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:05,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:05,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 05:17:05,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:05,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 05:17:05,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-06 05:17:05,123 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 05:17:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash 285712242, now seen corresponding path program 1 times [2022-12-06 05:17:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:05,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867571959] [2022-12-06 05:17:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:05,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 05:17:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:05,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867571959] [2022-12-06 05:17:05,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867571959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:05,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:05,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:05,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764936856] [2022-12-06 05:17:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:05,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:05,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:05,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:05,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:05,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 05:17:05,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:05,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:05,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:05,472 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:05,472 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:05,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:05,485 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:05,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:05,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:05,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 05:17:05,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:05,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:05,520 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:05,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 05:17:05,520 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:05,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:05,520 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:05,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:05,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:05,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:05,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:05,546 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:05,546 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:17:05,547 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 05:17:05,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:05,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:05,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:05,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:17:05,716 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:05,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 05:17:05,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:05,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 05:17:05,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-06 05:17:05,716 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 05:17:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2028522577, now seen corresponding path program 1 times [2022-12-06 05:17:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947703024] [2022-12-06 05:17:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:05,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947703024] [2022-12-06 05:17:05,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947703024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:05,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:05,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621323011] [2022-12-06 05:17:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:05,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:05,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:05,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:05,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:05,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:05,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:06,066 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:06,066 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:17:06,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 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 05:17:06,083 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:06,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:06,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:06,084 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:06,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:06,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:06,121 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,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 05:17:06,121 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:06,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:06,121 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:06,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:06,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,147 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:06,147 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:17:06,148 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 05:17:06,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:06,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:06,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:17:06,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:06,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:06,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:06,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:06,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-06 05:17:06,302 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 05:17:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -523634384, now seen corresponding path program 1 times [2022-12-06 05:17:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:06,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457831584] [2022-12-06 05:17:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457831584] [2022-12-06 05:17:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457831584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:06,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281181273] [2022-12-06 05:17:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:06,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:06,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:06,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:06,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:06,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:06,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:06,688 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:06,689 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:17:06,695 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 05:17:06,700 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:06,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:06,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:06,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 05:17:06,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:06,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 05:17:06,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,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 05:17:06,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:06,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:06,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:06,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:06,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,761 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:06,762 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:17:06,763 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 05:17:06,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:06,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:06,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:06,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:17:06,902 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:06,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:06,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:06,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:06,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-06 05:17:06,902 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 05:17:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1219175951, now seen corresponding path program 1 times [2022-12-06 05:17:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:06,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418361367] [2022-12-06 05:17:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:06,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 05:17:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:06,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418361367] [2022-12-06 05:17:06,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418361367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:06,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:06,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397143948] [2022-12-06 05:17:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:06,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:06,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:06,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:06,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 05:17:06,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:06,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:06,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:07,243 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:07,244 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:07,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 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 05:17:07,259 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:07,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:07,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:07,260 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:07,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:07,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 05:17:07,297 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,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 05:17:07,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:07,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:07,298 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:07,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:07,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,323 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:07,323 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:07,324 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 05:17:07,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:07,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:07,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:07,474 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:07,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 05:17:07,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:07,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 05:17:07,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-06 05:17:07,475 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 05:17:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1332981010, now seen corresponding path program 1 times [2022-12-06 05:17:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:07,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545197438] [2022-12-06 05:17:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:07,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 05:17:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:07,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545197438] [2022-12-06 05:17:07,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545197438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:07,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:07,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:07,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161020118] [2022-12-06 05:17:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:07,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:07,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:07,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:07,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 05:17:07,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:07,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:07,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:07,819 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:07,819 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:17:07,826 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 05:17:07,834 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:07,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:07,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:07,835 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:07,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:07,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 05:17:07,867 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,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 05:17:07,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:07,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:07,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:07,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:07,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:07,893 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:07,895 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 05:17:07,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:07,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:08,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:08,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:17:08,053 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:08,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 05:17:08,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17: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 05:17:08,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-06 05:17:08,054 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 05:17:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash 409829325, now seen corresponding path program 1 times [2022-12-06 05:17:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:08,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807564839] [2022-12-06 05:17:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:08,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 05:17:08,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:08,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807564839] [2022-12-06 05:17:08,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807564839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:08,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:08,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617097300] [2022-12-06 05:17:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:08,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:08,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:08,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:08,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 05:17:08,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:08,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:08,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:08,413 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:08,413 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:08,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 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 05:17:08,427 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:08,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:08,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:08,428 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:08,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:08,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 05:17:08,463 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:08,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 05:17:08,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:08,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:08,464 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:08,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:08,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:08,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:08,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:08,502 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:08,502 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:17:08,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 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 05:17:08,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:08,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:08,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:08,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:08,651 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:08,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 05:17:08,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:08,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 05:17:08,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-06 05:17:08,652 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 05:17:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2142327636, now seen corresponding path program 1 times [2022-12-06 05:17:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:08,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178497475] [2022-12-06 05:17:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:08,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 05:17:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:08,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178497475] [2022-12-06 05:17:08,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178497475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:08,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:08,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596368027] [2022-12-06 05:17:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:08,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:08,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:08,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 05:17:08,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:08,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:08,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:09,013 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:09,014 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:17:09,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 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 05:17:09,028 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:09,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:09,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:09,029 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:09,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:09,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 05:17:09,062 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,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 05:17:09,063 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:09,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:09,063 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:09,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:09,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,089 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:09,089 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:17:09,090 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 05:17:09,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:09,240 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:09,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:17:09,240 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:09,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 05:17:09,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:09,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 05:17:09,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-06 05:17:09,241 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 05:17:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash -399517301, now seen corresponding path program 1 times [2022-12-06 05:17:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:09,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575510832] [2022-12-06 05:17:09,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:09,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 05:17:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:09,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575510832] [2022-12-06 05:17:09,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575510832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:09,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:09,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563143891] [2022-12-06 05:17:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:09,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:09,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:09,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:09,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:09,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:09,680 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:09,680 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:09,687 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 05:17:09,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:09,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:09,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:09,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 05:17:09,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:09,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:09,730 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,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 05:17:09,730 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:09,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:09,730 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:09,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:09,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,755 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:09,755 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:17:09,756 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 05:17:09,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:09,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:09,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:09,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 05:17:09,962 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:09,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:09,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:09,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 05:17:09,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-06 05:17:09,963 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 05:17:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1343293034, now seen corresponding path program 1 times [2022-12-06 05:17:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:09,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569695891] [2022-12-06 05:17:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:10,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569695891] [2022-12-06 05:17:10,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569695891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:10,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:10,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528808359] [2022-12-06 05:17:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:10,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:10,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:10,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 05:17:10,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:10,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:10,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:10,325 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:10,325 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:10,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 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 05:17:10,340 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:10,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:10,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:10,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 05:17:10,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:10,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 05:17:10,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,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 05:17:10,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:10,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:10,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:10,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:10,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,401 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:10,401 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:10,402 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 05:17:10,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:10,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:10,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:17:10,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:10,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 05:17:10,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:10,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 05:17:10,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-06 05:17:10,553 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 05:17:10,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:10,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1208863927, now seen corresponding path program 1 times [2022-12-06 05:17:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:10,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172800332] [2022-12-06 05:17:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:10,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 05:17:10,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:10,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172800332] [2022-12-06 05:17:10,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172800332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:10,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:10,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932127181] [2022-12-06 05:17:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:10,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:10,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:10,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:10,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 05:17:10,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:10,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:10,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:10,923 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:10,923 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:10,938 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:10,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:10,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:10,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 05:17:10,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:10,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 05:17:10,974 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:10,974 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:10,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:10,974 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:10,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:10,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:10,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,000 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:11,000 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:11,001 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 05:17:11,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:11,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:11,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:17:11,164 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:11,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 05:17:11,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:11,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 05:17:11,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-06 05:17:11,165 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 05:17:11,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash 533946408, now seen corresponding path program 1 times [2022-12-06 05:17:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:11,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868273625] [2022-12-06 05:17:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:11,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 05:17:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:11,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868273625] [2022-12-06 05:17:11,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868273625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:11,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:11,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:11,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65693294] [2022-12-06 05:17:11,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:11,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:11,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:11,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:11,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:11,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:11,515 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:11,515 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:11,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 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 05:17:11,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:11,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:11,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:11,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 05:17:11,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:11,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 05:17:11,571 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,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 05:17:11,572 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:11,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:11,572 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:11,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:11,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,597 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:11,598 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:17:11,599 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 05:17:11,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:11,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:11,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:11,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:17:11,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:11,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:11,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:11,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:11,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-06 05:17:11,751 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 05:17:11,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2018210553, now seen corresponding path program 1 times [2022-12-06 05:17:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125271790] [2022-12-06 05:17:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:11,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 05:17:11,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:11,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125271790] [2022-12-06 05:17:11,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125271790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:11,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:11,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539952930] [2022-12-06 05:17:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:11,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:11,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:11,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 05:17:11,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:11,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:11,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:12,109 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:12,109 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:12,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 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 05:17:12,121 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:12,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:12,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:12,122 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:12,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:12,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 05:17:12,149 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,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 05:17:12,150 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:12,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:12,150 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:12,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:12,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,176 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:12,176 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:17:12,177 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 05:17:12,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:12,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:12,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:12,328 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:12,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 05:17:12,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:12,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 05:17:12,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-06 05:17:12,329 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 05:17:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash -275400218, now seen corresponding path program 1 times [2022-12-06 05:17:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:12,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679683978] [2022-12-06 05:17:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:12,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679683978] [2022-12-06 05:17:12,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679683978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:12,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:12,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393140581] [2022-12-06 05:17:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:12,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:12,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:12,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 05:17:12,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:12,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:12,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:12,655 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:12,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:12,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 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 05:17:12,670 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:12,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:12,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:12,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 05:17:12,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:12,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 05:17:12,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,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 05:17:12,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:12,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:12,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:12,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:12,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,739 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:12,740 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:17:12,741 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 05:17:12,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:12,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:12,885 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:12,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:12,886 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:12,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 05:17:12,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:12,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 05:17:12,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-06 05:17:12,886 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 05:17:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1467410117, now seen corresponding path program 1 times [2022-12-06 05:17:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528549363] [2022-12-06 05:17:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:12,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:12,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528549363] [2022-12-06 05:17:12,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528549363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:12,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:12,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646095917] [2022-12-06 05:17:12,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:12,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:12,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:12,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:12,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:12,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:12,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:12,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:13,271 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:13,271 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:13,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 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 05:17:13,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:13,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:13,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:13,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 05:17:13,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:13,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:13,321 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:13,321 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:13,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:13,321 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:13,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:13,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:13,349 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:17:13,350 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 05:17:13,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:13,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:13,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:13,508 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:13,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 05:17:13,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:13,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 05:17:13,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-06 05:17:13,509 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 05:17:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1084746844, now seen corresponding path program 1 times [2022-12-06 05:17:13,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:13,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128667591] [2022-12-06 05:17:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:13,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:13,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 05:17:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:13,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128667591] [2022-12-06 05:17:13,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128667591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:13,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:13,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926653371] [2022-12-06 05:17:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:13,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:13,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:13,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:13,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:13,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:13,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:13,873 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:13,873 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:13,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 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 05:17:13,888 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:13,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:13,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:13,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 05:17:13,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:13,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 05:17:13,921 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,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 05:17:13,922 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:13,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:13,922 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:13,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:13,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,947 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:13,947 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:17:13,948 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 05:17:13,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:13,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:14,103 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:14,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:14,104 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:14,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 05:17:14,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:14,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 05:17:14,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-06 05:17:14,104 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 05:17:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash 658063491, now seen corresponding path program 1 times [2022-12-06 05:17:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:14,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560025820] [2022-12-06 05:17:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:14,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 05:17:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:14,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560025820] [2022-12-06 05:17:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560025820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:14,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:14,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18183634] [2022-12-06 05:17:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:14,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:14,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:14,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:14,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:14,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:14,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:14,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:14,442 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:14,442 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:17:14,449 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 05:17:14,456 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:14,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:14,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:14,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 05:17:14,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:14,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 05:17:14,492 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:14,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 05:17:14,492 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:14,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:14,493 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:14,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:14,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:14,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:14,518 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:14,518 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:14,519 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 05:17:14,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:14,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:14,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:14,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:17:14,663 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:14,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 05:17:14,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:14,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 05:17:14,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-06 05:17:14,663 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 05:17:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1894093470, now seen corresponding path program 1 times [2022-12-06 05:17:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:14,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162080315] [2022-12-06 05:17:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:14,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 05:17:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:14,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162080315] [2022-12-06 05:17:14,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162080315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:14,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641503210] [2022-12-06 05:17:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:14,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:14,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:14,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:14,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:14,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:14,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 05:17:14,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:14,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:15,025 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:15,025 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:15,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 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 05:17:15,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:15,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:15,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:15,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 05:17:15,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:15,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:15,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,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 05:17:15,072 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:15,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:15,072 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:15,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:15,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,097 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:15,097 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:17:15,098 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 05:17:15,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:15,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:15,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 05:17:15,274 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:15,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 05:17:15,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:15,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 05:17:15,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-06 05:17:15,274 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 05:17:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash -151283135, now seen corresponding path program 1 times [2022-12-06 05:17:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:15,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010315151] [2022-12-06 05:17:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:15,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 05:17:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010315151] [2022-12-06 05:17:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010315151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:15,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:15,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470308908] [2022-12-06 05:17:15,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:15,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:15,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:15,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:15,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:15,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:15,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:15,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:15,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:15,638 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:15,639 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:15,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:15,654 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:15,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:15,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:15,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 05:17:15,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:15,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 05:17:15,693 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,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 05:17:15,693 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:15,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:15,693 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:15,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:15,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,718 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:15,718 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:17:15,719 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 05:17:15,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:15,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:15,890 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:15,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:17:15,891 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:15,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:15,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:15,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 05:17:15,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-06 05:17:15,891 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 05:17:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1591527200, now seen corresponding path program 1 times [2022-12-06 05:17:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:15,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579323386] [2022-12-06 05:17:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:15,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 05:17:15,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:15,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579323386] [2022-12-06 05:17:15,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579323386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:15,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:15,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242622533] [2022-12-06 05:17:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:15,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:15,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:15,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 05:17:15,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:15,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:15,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:16,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:16,290 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:16,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 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 05:17:16,305 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:16,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:16,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:16,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 05:17:16,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:16,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 05:17:16,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,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 05:17:16,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:16,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:16,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:16,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:16,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,365 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:16,365 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 05:17:16,367 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 05:17:16,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:16,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:16,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:17:16,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:16,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 05:17:16,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:16,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 05:17:16,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-06 05:17:16,511 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 05:17:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -960629761, now seen corresponding path program 1 times [2022-12-06 05:17:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:16,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701329129] [2022-12-06 05:17:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:16,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 05:17:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701329129] [2022-12-06 05:17:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701329129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:16,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:16,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832669516] [2022-12-06 05:17:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:16,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:16,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 05:17:16,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:16,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:16,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:16,839 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:16,839 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:17:16,846 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 05:17:16,854 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:16,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:16,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:16,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 05:17:16,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:16,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 05:17:16,889 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,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 05:17:16,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:16,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:16,889 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:16,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:16,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,925 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:16,925 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:17:16,927 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 05:17:16,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:16,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:17,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:17,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 05:17:17,101 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:17,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 05:17:17,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:17,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 05:17:17,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-06 05:17:17,101 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 05:17:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash 782180574, now seen corresponding path program 1 times [2022-12-06 05:17:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:17,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771805114] [2022-12-06 05:17:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:17,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 05:17:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:17,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771805114] [2022-12-06 05:17:17,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771805114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:17,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:17,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985626087] [2022-12-06 05:17:17,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:17,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:17,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:17,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:17,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:17,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:17,521 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:17,521 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:17,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 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 05:17:17,533 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:17,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:17,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:17,534 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:17,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:17,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:17,564 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:17,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 05:17:17,564 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:17,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:17,564 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:17,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:17,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:17,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:17,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:17,591 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:17,591 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:17,593 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 05:17:17,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:17,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:17,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:17,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:17,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:17,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:17,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:17,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:17,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-06 05:17:17,751 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 05:17:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1769976387, now seen corresponding path program 1 times [2022-12-06 05:17:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:17,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830851653] [2022-12-06 05:17:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:17,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 05:17:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:17,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830851653] [2022-12-06 05:17:17,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830851653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:17,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:17,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717940626] [2022-12-06 05:17:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:17,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:17,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:17,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:17,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:17,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:17,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:17,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:18,127 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:18,127 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:17:18,135 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 05:17:18,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:18,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:18,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:18,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:18,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:18,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:18,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:18,180 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,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 05:17:18,180 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:18,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:18,180 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:18,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:18,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,206 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:18,206 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:18,208 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 05:17:18,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:18,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:18,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:17:18,370 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17: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 05:17:18,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:18,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:18,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-06 05:17:18,371 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 05:17:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -27166052, now seen corresponding path program 1 times [2022-12-06 05:17:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:18,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578755193] [2022-12-06 05:17:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:18,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 05:17:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:18,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578755193] [2022-12-06 05:17:18,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578755193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:18,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:18,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647945114] [2022-12-06 05:17:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:18,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:18,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:18,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:18,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:18,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:18,690 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:18,691 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:18,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:18,706 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:18,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:18,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:18,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 05:17:18,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:18,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 05:17:18,740 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,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 05:17:18,741 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:18,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:18,741 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:18,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:18,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,768 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:18,768 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:17:18,769 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 05:17:18,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:18,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:18,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:18,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:17:18,930 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:18,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 05:17:18,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:18,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 05:17:18,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-06 05:17:18,930 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 05:17:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1715644283, now seen corresponding path program 1 times [2022-12-06 05:17:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:18,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460884894] [2022-12-06 05:17:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:18,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 05:17:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460884894] [2022-12-06 05:17:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460884894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:18,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:18,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427084191] [2022-12-06 05:17:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:18,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:18,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:18,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 05:17:18,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:18,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:18,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:19,262 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:19,262 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:19,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 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 05:17:19,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:19,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:19,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:19,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 05:17:19,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:19,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 05:17:19,310 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,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 05:17:19,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:19,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:19,310 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:19,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:19,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,335 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:19,335 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:17:19,337 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 05:17:19,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:19,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:19,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:17:19,482 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:19,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:19,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:19,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:19,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-06 05:17:19,482 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 05:17:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash -836512678, now seen corresponding path program 1 times [2022-12-06 05:17:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12054619] [2022-12-06 05:17:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:19,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 05:17:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:19,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12054619] [2022-12-06 05:17:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12054619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:19,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:19,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113545723] [2022-12-06 05:17:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:19,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:19,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:19,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 05:17:19,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:19,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:19,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:19,831 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:19,831 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:19,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 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 05:17:19,846 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:19,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:19,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:19,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 05:17:19,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:19,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 05:17:19,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,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 05:17:19,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:19,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:19,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:19,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:19,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,910 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:19,910 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:19,911 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 05:17:19,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:19,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:20,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:20,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:17:20,079 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:20,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:20,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:20,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-06 05:17:20,080 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 05:17:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash 906297657, now seen corresponding path program 1 times [2022-12-06 05:17:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:20,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485913469] [2022-12-06 05:17:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:20,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485913469] [2022-12-06 05:17:20,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485913469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:20,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:20,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:20,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458299755] [2022-12-06 05:17:20,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:20,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:20,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:20,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:20,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:20,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:20,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:20,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:20,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:20,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:20,447 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:20,447 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:20,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 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 05:17:20,462 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:20,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:20,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:20,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 05:17:20,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:20,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 05:17:20,496 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:20,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 05:17:20,496 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:20,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:20,496 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:20,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:20,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:20,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:20,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:20,521 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:20,521 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:20,522 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 05:17:20,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:20,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:20,671 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:20,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:20,672 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:20,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 05:17:20,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:20,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 05:17:20,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-06 05:17:20,672 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 05:17:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1645859304, now seen corresponding path program 1 times [2022-12-06 05:17:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:20,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647894286] [2022-12-06 05:17:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:20,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 05:17:20,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:20,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647894286] [2022-12-06 05:17:20,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647894286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:20,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:20,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:20,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601577395] [2022-12-06 05:17:20,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:20,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:20,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:20,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:20,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:20,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 05:17:20,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:20,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:20,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:21,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:21,037 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:21,044 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 05:17:21,052 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:21,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:21,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:21,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 05:17:21,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:21,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:21,087 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,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 05:17:21,088 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:21,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:21,088 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:21,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:21,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,116 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:21,116 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:17:21,117 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 05:17:21,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:21,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:21,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:21,266 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17: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 05:17:21,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17: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 05:17:21,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-06 05:17:21,266 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 05:17:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 96951031, now seen corresponding path program 1 times [2022-12-06 05:17:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:21,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095637300] [2022-12-06 05:17:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:21,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 05:17:21,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:21,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095637300] [2022-12-06 05:17:21,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095637300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:21,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:21,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:21,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975765909] [2022-12-06 05:17:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:21,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:21,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:21,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:21,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:21,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 05:17:21,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:21,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:21,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:21,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:21,621 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:17:21,627 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 05:17:21,634 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:21,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:21,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:21,635 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:21,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:21,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 05:17:21,664 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,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 05:17:21,665 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:21,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:21,665 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:21,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:21,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:21,690 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:17:21,691 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 05:17:21,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:21,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:21,844 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:21,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:17:21,845 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:21,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:21,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:21,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:21,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-06 05:17:21,845 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 05:17:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1839761366, now seen corresponding path program 1 times [2022-12-06 05:17:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:21,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038268629] [2022-12-06 05:17:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:21,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 05:17:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:21,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038268629] [2022-12-06 05:17:21,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038268629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:21,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:21,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268323225] [2022-12-06 05:17:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:21,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:21,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:21,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:21,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:21,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 05:17:21,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:21,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:21,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:22,168 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:22,168 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:22,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:22,187 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:22,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:22,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:22,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:22,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 05:17:22,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:22,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 05:17:22,220 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,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 05:17:22,220 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:22,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:22,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:22,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:22,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,245 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:22,245 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:22,246 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 05:17:22,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:22,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:22,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:22,397 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:22,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:22,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:22,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-06 05:17:22,398 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 05:17:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -712395595, now seen corresponding path program 1 times [2022-12-06 05:17:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:22,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041722902] [2022-12-06 05:17:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:22,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 05:17:22,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:22,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041722902] [2022-12-06 05:17:22,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041722902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:22,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:22,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149643848] [2022-12-06 05:17:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:22,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:22,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 05:17:22,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:22,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:22,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:22,725 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:22,726 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:22,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:22,740 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:22,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:22,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:22,741 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:22,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:22,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 05:17:22,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,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 05:17:22,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:22,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:22,814 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:22,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:22,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,846 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:22,847 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:17:22,848 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 05:17:22,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:22,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:23,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:23,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:17:23,029 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:23,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:23,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:23,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 05:17:23,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-06 05:17:23,030 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 05:17:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1030414740, now seen corresponding path program 1 times [2022-12-06 05:17:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:23,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718650220] [2022-12-06 05:17:23,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:23,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:23,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718650220] [2022-12-06 05:17:23,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718650220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:23,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177304883] [2022-12-06 05:17:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:23,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:23,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:23,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:23,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:23,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 05:17:23,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:23,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:23,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:23,392 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:23,393 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:17:23,399 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 05:17:23,407 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:23,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:23,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:23,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 05:17:23,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:23,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:23,441 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:23,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 05:17:23,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:23,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:23,442 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:23,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:23,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:23,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:23,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:23,467 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:23,467 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:17:23,468 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 05:17:23,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:23,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:23,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:23,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:17:23,630 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:23,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:23,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:23,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:23,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-06 05:17:23,630 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 05:17:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1521742221, now seen corresponding path program 1 times [2022-12-06 05:17:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:23,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990902910] [2022-12-06 05:17:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:23,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 05:17:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990902910] [2022-12-06 05:17:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990902910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:23,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:23,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663005723] [2022-12-06 05:17:23,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:23,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:23,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:23,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 05:17:23,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:23,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:23,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:23,996 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:23,996 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:24,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 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 05:17:24,010 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:24,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:24,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:24,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 05:17:24,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:24,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:24,044 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:24,045 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:24,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:24,045 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:24,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:24,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,071 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:24,072 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:24,073 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 05:17:24,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:24,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:24,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:17:24,220 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:24,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 05:17:24,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:24,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 05:17:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-06 05:17:24,220 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 05:17:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 221068114, now seen corresponding path program 1 times [2022-12-06 05:17:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:24,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624004388] [2022-12-06 05:17:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:24,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 05:17:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:24,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624004388] [2022-12-06 05:17:24,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624004388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:24,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:24,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140196183] [2022-12-06 05:17:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:24,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:24,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:24,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:24,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:24,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:24,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:24,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:24,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:24,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:24,588 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:17:24,598 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 05:17:24,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:24,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:24,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:24,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 05:17:24,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:24,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 05:17:24,660 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:24,660 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:24,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:24,660 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:24,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:24,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,695 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:24,695 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:17:24,697 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 05:17:24,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:24,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:24,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:24,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 05:17:24,883 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:24,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 05:17:24,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:24,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 05:17:24,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-06 05:17:24,884 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 05:17:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1963878449, now seen corresponding path program 1 times [2022-12-06 05:17:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526698283] [2022-12-06 05:17:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:24,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 05:17:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526698283] [2022-12-06 05:17:24,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526698283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:24,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:24,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076561315] [2022-12-06 05:17:24,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:24,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:24,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:24,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:24,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 05:17:24,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:24,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:24,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:25,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:25,210 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:17:25,217 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 05:17:25,224 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:25,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:25,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:25,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 05:17:25,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:25,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 05:17:25,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:25,258 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:25,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:25,258 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:25,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:25,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,286 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:25,286 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:17:25,287 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 05:17:25,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:25,435 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:25,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:25,436 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:25,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 05:17:25,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:25,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-06 05:17:25,436 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 05:17:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -588278512, now seen corresponding path program 1 times [2022-12-06 05:17:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:25,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860394311] [2022-12-06 05:17:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:25,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 05:17:25,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:25,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860394311] [2022-12-06 05:17:25,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860394311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:25,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:25,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56274977] [2022-12-06 05:17:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:25,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:25,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:25,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 05:17:25,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:25,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:25,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:25,764 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:25,764 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:25,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 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 05:17:25,777 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:25,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:25,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:25,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 05:17:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:25,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:25,819 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,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 05:17:25,819 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:25,819 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:25,819 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,820 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:25,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:25,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,852 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:25,852 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:17:25,854 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 05:17:25,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:25,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:26,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:26,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 05:17:26,044 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:26,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 05:17:26,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:26,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 05:17:26,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-06 05:17:26,044 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 05:17:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1154531823, now seen corresponding path program 1 times [2022-12-06 05:17:26,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:26,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171363260] [2022-12-06 05:17:26,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:26,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:26,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171363260] [2022-12-06 05:17:26,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171363260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:26,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:26,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238193619] [2022-12-06 05:17:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:26,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:26,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:26,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:26,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:26,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:26,395 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:26,395 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:26,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 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 05:17:26,411 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:26,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:26,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:26,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 05:17:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:26,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 05:17:26,446 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:26,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:26,446 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:26,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:26,446 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:26,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:26,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:26,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:26,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:26,471 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:26,471 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:17:26,472 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 05:17:26,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:26,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:26,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:26,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:17:26,619 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:26,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:26,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:26,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:26,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-06 05:17:26,619 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 05:17:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1397625138, now seen corresponding path program 1 times [2022-12-06 05:17:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:26,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541099988] [2022-12-06 05:17:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:26,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:26,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 05:17:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:26,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541099988] [2022-12-06 05:17:26,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541099988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:26,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:26,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43752305] [2022-12-06 05:17:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:26,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:26,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:26,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 05:17:26,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:26,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:26,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:26,980 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:26,980 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:26,986 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 05:17:26,991 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:26,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:26,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:26,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:26,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 05:17:26,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:27,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:27,021 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:27,022 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:27,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:27,022 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:27,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:27,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,046 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:27,047 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:27,048 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 05:17:27,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:27,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:27,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:27,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:27,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:27,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:27,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:27,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-06 05:17:27,198 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 05:17:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 345185197, now seen corresponding path program 1 times [2022-12-06 05:17:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:27,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983536494] [2022-12-06 05:17:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:27,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 05:17:27,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:27,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983536494] [2022-12-06 05:17:27,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983536494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:27,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:27,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:27,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503701922] [2022-12-06 05:17:27,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:27,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:27,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:27,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:27,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 05:17:27,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:27,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:27,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:27,540 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:27,540 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:27,547 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 05:17:27,555 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:27,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:27,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:27,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 05:17:27,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:27,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 05:17:27,588 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,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 05:17:27,588 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:27,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:27,589 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:27,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:27,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,616 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:27,616 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:17:27,617 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 05:17:27,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:27,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:27,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:27,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:17:27,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:27,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:27,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:27,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 05:17:27,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-06 05:17:27,778 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 05:17:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2087995532, now seen corresponding path program 1 times [2022-12-06 05:17:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:27,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536648768] [2022-12-06 05:17:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:27,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 05:17:27,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:27,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536648768] [2022-12-06 05:17:27,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536648768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:27,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:27,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:27,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102845739] [2022-12-06 05:17:27,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:27,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:27,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:27,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 05:17:27,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:27,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:27,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:28,115 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:28,116 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:28,122 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 05:17:28,130 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:28,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:28,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:28,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 05:17:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:28,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:28,189 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,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 05:17:28,190 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:28,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:28,190 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:28,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:28,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,215 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:28,215 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:17:28,216 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 05:17:28,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:28,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:28,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:17:28,370 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:28,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 05:17:28,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:28,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 05:17:28,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-06 05:17:28,370 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 05:17:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash -464161429, now seen corresponding path program 1 times [2022-12-06 05:17:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:28,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460765187] [2022-12-06 05:17:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:28,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:28,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460765187] [2022-12-06 05:17:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460765187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:28,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972930202] [2022-12-06 05:17:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:28,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:28,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:28,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:28,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 05:17:28,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:28,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:28,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:28,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:28,691 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:28,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:28,705 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:28,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:28,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:28,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 05:17:28,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:28,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 05:17:28,738 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,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 05:17:28,739 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:28,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:28,739 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:28,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:28,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,763 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:28,764 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:28,765 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 05:17:28,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:28,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:28,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:28,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:17:28,914 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:28,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 05:17:28,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:28,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 05:17:28,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-06 05:17:28,914 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 05:17:28,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1278648906, now seen corresponding path program 1 times [2022-12-06 05:17:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:28,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827344046] [2022-12-06 05:17:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:28,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827344046] [2022-12-06 05:17:28,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827344046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:28,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:28,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895164474] [2022-12-06 05:17:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:28,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:28,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:28,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 05:17:28,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:28,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:28,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:29,247 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:29,247 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:29,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:29,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:29,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:29,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:29,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 05:17:29,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:29,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 05:17:29,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,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 05:17:29,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:29,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:29,298 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:29,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:29,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,326 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:29,326 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:29,328 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 05:17:29,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:29,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:29,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:17:29,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:29,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 05:17:29,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:29,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 05:17:29,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-06 05:17:29,493 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 05:17:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1273508055, now seen corresponding path program 1 times [2022-12-06 05:17:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055140984] [2022-12-06 05:17:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:29,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 05:17:29,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:29,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055140984] [2022-12-06 05:17:29,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055140984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:29,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:29,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:29,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345096034] [2022-12-06 05:17:29,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:29,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:29,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:29,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 05:17:29,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:29,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:29,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:29,845 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:29,845 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:29,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 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 05:17:29,859 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:29,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:29,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:29,860 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:29,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:29,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 05:17:29,892 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,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 05:17:29,892 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:29,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:29,892 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:29,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:29,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,917 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:29,917 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:29,918 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 05:17:29,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:29,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:30,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:30,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:17:30,069 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:30,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 05:17:30,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:30,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:30,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-06 05:17:30,070 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 05:17:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash 469302280, now seen corresponding path program 1 times [2022-12-06 05:17:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:30,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851448263] [2022-12-06 05:17:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:30,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 05:17:30,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:30,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851448263] [2022-12-06 05:17:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851448263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127394471] [2022-12-06 05:17:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:30,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:30,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:30,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 05:17:30,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:30,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:30,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:30,404 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:30,404 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:30,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 05:17:30,419 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:30,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:30,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:30,420 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:30,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:30,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 05:17:30,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:30,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 05:17:30,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:30,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:30,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:30,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:30,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:30,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:30,479 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:30,479 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:17:30,480 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 05:17:30,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:30,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:30,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:30,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:17:30,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:30,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 05:17:30,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:30,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 05:17:30,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-06 05:17:30,623 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 05:17:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2082854681, now seen corresponding path program 1 times [2022-12-06 05:17:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:30,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381912394] [2022-12-06 05:17:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:30,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 05:17:30,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:30,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381912394] [2022-12-06 05:17:30,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381912394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:30,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:30,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848370458] [2022-12-06 05:17:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:30,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:30,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:30,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 05:17:30,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:30,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:30,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:30,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:30,980 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:30,986 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 05:17:30,993 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:30,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:30,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:30,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:30,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 05:17:30,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:31,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 05:17:31,025 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,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 05:17:31,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:31,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:31,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:31,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:31,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,051 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:31,051 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:17:31,053 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 05:17:31,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:31,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:31,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:17:31,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17: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 05:17:31,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:31,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 05:17:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-06 05:17:31,218 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 05:17:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash -340044346, now seen corresponding path program 1 times [2022-12-06 05:17:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:31,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155172193] [2022-12-06 05:17:31,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:31,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 05:17:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155172193] [2022-12-06 05:17:31,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155172193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:31,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:31,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132112366] [2022-12-06 05:17:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:31,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:31,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:31,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 05:17:31,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:31,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:31,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:31,544 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:31,544 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:31,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 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 05:17:31,559 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:31,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:31,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:31,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 05:17:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:31,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 05:17:31,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,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 05:17:31,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:31,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:31,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:31,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:31,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,616 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:31,616 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:17:31,617 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 05:17:31,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:31,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:31,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:31,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:17:31,772 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:31,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:31,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:31,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:31,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-06 05:17:31,773 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 05:17:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1402765989, now seen corresponding path program 1 times [2022-12-06 05:17:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:31,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259365790] [2022-12-06 05:17:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:31,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 05:17:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:31,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259365790] [2022-12-06 05:17:31,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259365790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:31,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:31,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168161925] [2022-12-06 05:17:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:31,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:31,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:31,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:31,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:31,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:31,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:32,151 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:32,151 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:32,158 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 05:17:32,164 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:32,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:32,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:32,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 05:17:32,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:32,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:32,193 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,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 05:17:32,193 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:32,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:32,193 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:32,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:32,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,218 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:32,218 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:32,219 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 05:17:32,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:32,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:32,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:17:32,359 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:32,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:32,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:32,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:32,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-06 05:17:32,360 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 05:17:32,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1149390972, now seen corresponding path program 1 times [2022-12-06 05:17:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673372331] [2022-12-06 05:17:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:32,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673372331] [2022-12-06 05:17:32,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673372331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:32,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:32,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914983636] [2022-12-06 05:17:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:32,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:32,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:32,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:32,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 05:17:32,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:32,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:32,725 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:32,725 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:32,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:32,741 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:32,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:32,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:32,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 05:17:32,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:32,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:32,779 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:32,779 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:32,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:32,779 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:32,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:32,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,804 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:32,804 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:17:32,805 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 05:17:32,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:32,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:32,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:32,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:17:32,955 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:32,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:32,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:32,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:32,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-06 05:17:32,956 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 05:17:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 593419363, now seen corresponding path program 1 times [2022-12-06 05:17:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:32,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654350044] [2022-12-06 05:17:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:32,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:33,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 05:17:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:33,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654350044] [2022-12-06 05:17:33,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654350044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:33,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:33,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:33,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641876661] [2022-12-06 05:17:33,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:33,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:33,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:33,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:33,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:33,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 05:17:33,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:33,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:33,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:33,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:33,293 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:33,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 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 05:17:33,309 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:33,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:33,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:33,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 05:17:33,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:33,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:33,344 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:33,345 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:33,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:33,345 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:33,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:33,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,376 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:33,376 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:33,377 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 05:17:33,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:33,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:33,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:33,532 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:33,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 05:17:33,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:33,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:33,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-06 05:17:33,533 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 05:17:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:33,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1958737598, now seen corresponding path program 1 times [2022-12-06 05:17:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:33,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040550225] [2022-12-06 05:17:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:33,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 05:17:33,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:33,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040550225] [2022-12-06 05:17:33,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040550225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:33,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:33,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423892639] [2022-12-06 05:17:33,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:33,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:33,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:33,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:33,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:33,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:33,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:33,901 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:33,901 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:33,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 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 05:17:33,916 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:33,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:33,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:33,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 05:17:33,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:33,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 05:17:33,966 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,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 05:17:33,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:33,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:33,967 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:33,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:33,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:33,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,002 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:34,003 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:34,004 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 05:17:34,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:34,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:34,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 05:17:34,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:34,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 05:17:34,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:34,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 05:17:34,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-06 05:17:34,190 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 05:17:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash -215927263, now seen corresponding path program 1 times [2022-12-06 05:17:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:34,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315580028] [2022-12-06 05:17:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:34,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:34,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315580028] [2022-12-06 05:17:34,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315580028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:34,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:34,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432519405] [2022-12-06 05:17:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:34,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:34,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 05:17:34,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:34,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:34,566 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:34,566 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:34,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 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 05:17:34,581 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:34,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:34,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:34,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 05:17:34,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:34,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:34,616 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,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 05:17:34,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:34,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:34,617 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:34,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:34,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,642 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:34,642 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:34,643 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 05:17:34,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:34,645 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:34,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:34,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:17:34,816 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:34,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 05:17:34,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:34,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 05:17:34,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-06 05:17:34,816 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 05:17:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1526883072, now seen corresponding path program 1 times [2022-12-06 05:17:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:34,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291215254] [2022-12-06 05:17:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:34,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 05:17:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:34,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291215254] [2022-12-06 05:17:34,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291215254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:34,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:34,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:34,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684435137] [2022-12-06 05:17:34,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:34,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:34,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:34,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:34,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:34,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 05:17:34,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:34,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:34,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:35,184 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:35,184 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:35,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:35,199 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:35,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:35,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:35,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 05:17:35,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:35,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 05:17:35,234 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,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 05:17:35,234 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:35,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:35,234 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,235 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:35,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:35,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,260 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:35,260 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:17:35,261 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 05:17:35,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:35,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:35,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:17:35,408 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:35,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 05:17:35,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:35,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-06 05:17:35,409 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 05:17:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1025273889, now seen corresponding path program 1 times [2022-12-06 05:17:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:35,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856161184] [2022-12-06 05:17:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:35,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 05:17:35,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:35,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856161184] [2022-12-06 05:17:35,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856161184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:35,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:35,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492835545] [2022-12-06 05:17:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:35,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:35,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:35,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 05:17:35,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:35,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:35,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:35,753 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:35,754 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:35,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:35,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:35,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:35,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:35,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 05:17:35,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:35,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:35,804 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:35,804 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:35,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:35,804 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:35,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:35,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,830 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:35,830 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:17:35,831 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 05:17:35,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:35,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:36,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:36,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 05:17:36,008 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:36,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 05:17:36,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:36,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 05:17:36,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-06 05:17:36,009 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 05:17:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash 717536446, now seen corresponding path program 1 times [2022-12-06 05:17:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:36,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863084565] [2022-12-06 05:17:36,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:36,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:36,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 05:17:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:36,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863084565] [2022-12-06 05:17:36,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863084565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:36,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:36,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354410862] [2022-12-06 05:17:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:36,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:36,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:36,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:36,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:36,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:36,415 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:36,416 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:17:36,423 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 05:17:36,430 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:36,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:36,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:36,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 05:17:36,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:36,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 05:17:36,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:36,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 05:17:36,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:36,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:36,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:36,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:36,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:36,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:36,489 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:36,490 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:36,491 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 05:17:36,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:36,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:36,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:36,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:36,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:36,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:36,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:36,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 05:17:36,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-06 05:17:36,648 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 05:17:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1834620515, now seen corresponding path program 1 times [2022-12-06 05:17:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:36,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543829625] [2022-12-06 05:17:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:36,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 05:17:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:36,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543829625] [2022-12-06 05:17:36,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543829625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:36,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:36,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428999275] [2022-12-06 05:17:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:36,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:36,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:36,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 05:17:36,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:36,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:36,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:36,985 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:36,985 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:36,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:37,001 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:37,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:37,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:37,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 05:17:37,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:37,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 05:17:37,036 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:37,036 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:37,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:37,036 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:37,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:37,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,066 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:37,066 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:17:37,067 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 05:17:37,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:37,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:37,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 05:17:37,255 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:37,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:37,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:37,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:37,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-06 05:17:37,256 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 05:17:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -91810180, now seen corresponding path program 1 times [2022-12-06 05:17:37,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:37,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906065555] [2022-12-06 05:17:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:37,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 05:17:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:37,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906065555] [2022-12-06 05:17:37,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906065555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:37,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:37,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:37,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795303969] [2022-12-06 05:17:37,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:37,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:37,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:37,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:37,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 05:17:37,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:37,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:37,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:37,630 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:37,631 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:37,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:37,643 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:37,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:37,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:37,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 05:17:37,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:37,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 05:17:37,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,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 05:17:37,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:37,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:37,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:37,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:37,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,699 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:37,699 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:17:37,700 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 05:17:37,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:37,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:37,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:37,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:37,856 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:37,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 05:17:37,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:37,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 05:17:37,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-06 05:17:37,856 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 05:17:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1651000155, now seen corresponding path program 1 times [2022-12-06 05:17:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:37,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844745913] [2022-12-06 05:17:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844745913] [2022-12-06 05:17:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844745913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:37,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:37,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:37,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360078268] [2022-12-06 05:17:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:37,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:37,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:37,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:37,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:37,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:37,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:37,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:37,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:38,203 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:38,203 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:17:38,210 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 05:17:38,217 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:38,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:38,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:38,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 05:17:38,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17: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 05:17:38,252 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,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 05:17:38,252 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:38,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:38,252 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:38,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:38,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,277 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:38,277 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:38,278 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 05:17:38,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:38,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:38,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:17:38,438 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:38,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 05:17:38,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:38,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:38,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-06 05:17:38,439 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 05:17:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -901156806, now seen corresponding path program 1 times [2022-12-06 05:17:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166568235] [2022-12-06 05:17:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17: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 05:17:38,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166568235] [2022-12-06 05:17:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166568235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:38,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631998615] [2022-12-06 05:17:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:38,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:38,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17: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 05:17:38,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:38,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:38,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:38,772 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:38,772 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:38,780 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 05:17:38,788 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:38,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:38,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:38,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 05:17:38,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:38,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 05:17:38,826 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:38,827 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:38,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:38,827 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:38,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:38,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,870 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:38,871 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:38,872 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 05:17:38,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:38,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:39,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:39,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:17:39,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:39,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 05:17:39,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:39,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 05:17:39,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-06 05:17:39,023 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 05:17:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 841653529, now seen corresponding path program 1 times [2022-12-06 05:17:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:39,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602840824] [2022-12-06 05:17:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:39,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:39,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 05:17:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:39,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602840824] [2022-12-06 05:17:39,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602840824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:39,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:39,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27582745] [2022-12-06 05:17:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:39,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:39,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:39,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 05:17:39,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:39,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:39,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:39,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:39,375 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:39,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 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 05:17:39,391 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:39,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:39,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:39,392 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:39,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:39,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:39,426 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:39,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:39,426 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:39,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:39,426 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:39,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:39,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:39,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:39,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:39,452 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:39,452 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:17:39,454 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 05:17:39,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:39,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:39,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:39,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:39,604 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:39,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 05:17:39,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:39,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 05:17:39,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-06 05:17:39,604 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 05:17:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1710503432, now seen corresponding path program 1 times [2022-12-06 05:17:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:39,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116925506] [2022-12-06 05:17:39,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:39,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 05:17:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:39,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116925506] [2022-12-06 05:17:39,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116925506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:39,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:39,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534830040] [2022-12-06 05:17:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:39,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:39,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:39,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:39,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 05:17:39,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:39,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:39,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:39,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:39,949 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:39,957 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 05:17:39,965 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:39,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:39,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:39,966 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:39,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:39,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:39,999 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:39,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:40,000 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:40,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:40,000 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:40,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:40,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,029 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:40,030 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:17:40,031 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 05:17:40,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:40,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:40,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:17:40,188 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:40,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 05:17:40,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:40,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:40,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-06 05:17:40,189 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 05:17:40,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:40,189 INFO L85 PathProgramCache]: Analyzing trace with hash 32306903, now seen corresponding path program 1 times [2022-12-06 05:17:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:40,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910969058] [2022-12-06 05:17:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:40,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 05:17:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:40,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910969058] [2022-12-06 05:17:40,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910969058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:40,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:40,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891476954] [2022-12-06 05:17:40,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:40,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:40,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:40,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:40,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:40,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:40,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:40,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:40,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:40,599 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:17:40,607 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 05:17:40,616 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:40,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:40,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:40,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 05:17:40,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:40,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 05:17:40,650 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:40,651 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:40,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:40,651 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:40,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:40,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,678 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:40,678 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:17:40,679 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 05:17:40,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:40,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:40,828 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:40,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:17:40,828 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:40,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 05:17:40,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:40,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 05:17:40,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-06 05:17:40,829 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 05:17:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1775117238, now seen corresponding path program 1 times [2022-12-06 05:17:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:40,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372440038] [2022-12-06 05:17:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:40,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 05:17:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:40,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372440038] [2022-12-06 05:17:40,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372440038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:40,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:40,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774615435] [2022-12-06 05:17:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:40,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:40,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:40,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:40,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:40,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 05:17:40,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:40,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:40,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:41,180 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:41,180 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:17:41,187 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 05:17:41,194 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:41,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:41,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:41,195 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:41,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:41,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:41,226 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,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 05:17:41,227 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:41,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:41,227 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:41,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:41,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,251 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:41,252 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:41,252 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 05:17:41,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:41,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:41,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:17:41,401 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:41,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:41,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:41,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:41,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-06 05:17:41,401 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 05:17:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash -777039723, now seen corresponding path program 1 times [2022-12-06 05:17:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:41,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346686430] [2022-12-06 05:17:41,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:41,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 05:17:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:41,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346686430] [2022-12-06 05:17:41,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346686430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:41,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278161195] [2022-12-06 05:17:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:41,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:41,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 05:17:41,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:41,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:41,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:41,753 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:41,753 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:41,760 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 05:17:41,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:41,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:41,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:41,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 05:17:41,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:41,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 05:17:41,798 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,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 05:17:41,798 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:41,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:41,798 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:41,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:41,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,823 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:41,823 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:17:41,824 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 05:17:41,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:41,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:41,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:41,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:17:41,977 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:41,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:41,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:41,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-06 05:17:41,977 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 05:17:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash 965770612, now seen corresponding path program 1 times [2022-12-06 05:17:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165193994] [2022-12-06 05:17:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:42,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165193994] [2022-12-06 05:17:42,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165193994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:42,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:42,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53937041] [2022-12-06 05:17:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:42,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:42,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:42,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:42,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:42,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:42,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:42,317 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:42,317 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:42,324 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 05:17:42,331 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:42,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:42,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:42,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 05:17:42,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:42,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 05:17:42,364 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,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 05:17:42,365 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:42,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:42,365 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:42,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:42,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,389 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:42,389 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:17:42,390 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 05:17:42,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:42,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:42,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:17:42,551 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:42,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 05:17:42,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:42,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 05:17:42,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-06 05:17:42,552 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 05:17:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1586386349, now seen corresponding path program 1 times [2022-12-06 05:17:42,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:42,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821383949] [2022-12-06 05:17:42,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:42,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:42,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:42,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821383949] [2022-12-06 05:17:42,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821383949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:42,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:42,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:42,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239165864] [2022-12-06 05:17:42,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:42,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:42,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:42,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 05:17:42,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:42,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:42,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:42,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:42,918 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:42,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:42,931 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:42,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:42,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:42,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 05:17:42,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:42,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 05:17:42,961 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,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 05:17:42,961 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:42,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:42,961 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:42,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:42,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,986 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:42,986 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:17:42,987 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 05:17:42,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:42,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:43,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:43,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:17:43,135 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:43,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:43,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:43,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:43,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-06 05:17:43,135 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 05:17:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 156423986, now seen corresponding path program 1 times [2022-12-06 05:17:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:43,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197305505] [2022-12-06 05:17:43,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:43,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 05:17:43,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197305505] [2022-12-06 05:17:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197305505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:43,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:43,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688011382] [2022-12-06 05:17:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:43,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:43,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:43,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:43,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 05:17:43,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:43,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:43,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:43,570 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:43,570 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:43,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:43,591 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:43,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:43,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:43,592 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:43,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:43,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:43,640 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:43,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:43,640 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:43,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:43,640 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:43,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:43,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:43,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:43,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:43,675 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:43,676 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:43,677 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 05:17:43,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:43,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:43,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:43,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 05:17:43,850 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:43,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 05:17:43,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:43,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 05:17:43,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-06 05:17:43,850 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 05:17:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1899234321, now seen corresponding path program 1 times [2022-12-06 05:17:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:43,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439971129] [2022-12-06 05:17:43,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:43,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:43,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 05:17:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:43,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439971129] [2022-12-06 05:17:43,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439971129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:43,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:43,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695757628] [2022-12-06 05:17:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:43,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:43,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 05:17:43,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:43,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:43,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:44,195 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:44,196 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:17:44,202 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 05:17:44,209 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:44,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:44,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:44,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 05:17:44,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:44,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 05:17:44,239 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,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 05:17:44,240 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:44,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:44,240 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:44,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:44,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,272 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:44,272 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:44,273 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 05:17:44,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:44,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:44,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:17:44,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:44,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 05:17:44,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:44,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 05:17:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-06 05:17:44,413 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 05:17:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -652922640, now seen corresponding path program 1 times [2022-12-06 05:17:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:44,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964925260] [2022-12-06 05:17:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:44,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:44,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964925260] [2022-12-06 05:17:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964925260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:44,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:44,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474018969] [2022-12-06 05:17:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:44,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:44,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 05:17:44,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:44,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:44,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:44,755 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:44,755 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:44,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:44,770 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:44,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:44,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:44,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 05:17:44,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:44,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 05:17:44,803 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:44,803 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:44,803 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:44,803 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:44,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:44,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,833 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:44,833 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:17:44,834 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 05:17:44,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:44,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:44,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:44,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:17:44,994 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:44,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:44,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:44,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:44,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-06 05:17:44,994 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 05:17:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1089887695, now seen corresponding path program 1 times [2022-12-06 05:17:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:44,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988341767] [2022-12-06 05:17:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:45,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988341767] [2022-12-06 05:17:45,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988341767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:45,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:45,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128043768] [2022-12-06 05:17:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:45,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:45,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:45,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 05:17:45,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:45,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:45,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:45,333 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:45,333 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:17:45,340 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 05:17:45,347 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:45,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:45,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:45,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 05:17:45,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:45,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:45,378 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,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 05:17:45,379 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:45,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:45,379 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:45,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:45,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,403 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:45,404 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:17:45,404 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 05:17:45,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,406 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:45,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:45,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:17:45,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:45,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 05:17:45,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:45,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 05:17:45,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-06 05:17:45,553 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 05:17:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1462269266, now seen corresponding path program 1 times [2022-12-06 05:17:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:45,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760475300] [2022-12-06 05:17:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:45,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760475300] [2022-12-06 05:17:45,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760475300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:45,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:45,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894291271] [2022-12-06 05:17:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:45,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:45,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:45,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 05:17:45,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:45,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:45,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:45,909 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:45,909 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:17:45,916 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 05:17:45,923 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:45,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:45,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:45,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 05:17:45,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:45,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 05:17:45,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,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 05:17:45,956 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:45,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:45,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:45,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:45,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,980 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:45,981 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:45,982 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 05:17:45,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:45,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:46,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:46,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 05:17:46,183 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:46,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 05:17:46,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:46,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:46,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-06 05:17:46,184 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 05:17:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 280541069, now seen corresponding path program 1 times [2022-12-06 05:17:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372248543] [2022-12-06 05:17:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372248543] [2022-12-06 05:17:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372248543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:46,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:46,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544148354] [2022-12-06 05:17:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:46,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:46,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:46,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:46,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:46,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:46,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:46,602 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:46,602 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:17:46,613 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 05:17:46,623 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:46,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:46,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:46,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 05:17:46,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:46,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:46,676 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:46,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 05:17:46,676 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:46,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:46,677 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:46,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:46,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:46,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:46,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:46,712 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:46,712 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:17:46,714 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 05:17:46,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:46,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:46,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:46,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 05:17:46,917 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:46,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 05:17:46,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:46,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 05:17:46,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-06 05:17:46,917 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 05:17:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2023351404, now seen corresponding path program 1 times [2022-12-06 05:17:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:46,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123621691] [2022-12-06 05:17:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:46,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 05:17:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:46,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123621691] [2022-12-06 05:17:46,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123621691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:46,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:46,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895063335] [2022-12-06 05:17:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:46,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:46,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:46,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:46,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 05:17:46,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:46,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:47,265 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:47,265 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:47,272 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 05:17:47,279 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:47,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:47,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:47,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:47,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:47,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 05:17:47,309 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,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 05:17:47,309 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:47,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:47,309 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:47,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:47,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,334 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:47,334 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:17:47,335 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 05:17:47,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:47,487 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:47,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:17:47,488 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:47,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:47,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:47,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:47,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-06 05:17:47,488 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 05:17:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -528805557, now seen corresponding path program 1 times [2022-12-06 05:17:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:47,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068999784] [2022-12-06 05:17:47,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:47,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 05:17:47,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:47,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068999784] [2022-12-06 05:17:47,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068999784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:47,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:47,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057237574] [2022-12-06 05:17:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:47,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:47,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:47,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 05:17:47,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:47,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:47,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:47,812 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:47,812 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:47,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:47,827 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:47,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:47,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:47,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 05:17:47,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:47,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 05:17:47,863 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,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 05:17:47,863 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:47,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:47,864 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:47,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:47,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,889 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:47,889 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:17:47,890 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 05:17:47,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:47,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:48,033 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:48,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:17:48,034 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:48,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:48,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:48,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:48,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-06 05:17:48,034 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 05:17:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1214004778, now seen corresponding path program 1 times [2022-12-06 05:17:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:48,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263875843] [2022-12-06 05:17:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:48,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263875843] [2022-12-06 05:17:48,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263875843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:48,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:48,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87986371] [2022-12-06 05:17:48,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:48,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:48,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:48,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:48,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:48,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 05:17:48,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:48,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:48,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:48,391 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:48,391 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:17:48,397 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 05:17:48,402 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:48,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:48,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:48,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 05:17:48,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:48,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 05:17:48,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,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 05:17:48,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:48,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:48,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:48,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:48,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,454 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:48,454 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:48,455 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 05:17:48,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:48,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:48,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 05:17:48,593 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:48,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 05:17:48,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:48,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 05:17:48,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-06 05:17:48,593 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 05:17:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1338152183, now seen corresponding path program 1 times [2022-12-06 05:17:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:48,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229636672] [2022-12-06 05:17:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:48,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 05:17:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229636672] [2022-12-06 05:17:48,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229636672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:48,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:48,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332447388] [2022-12-06 05:17:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:48,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:48,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:48,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 05:17:48,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:48,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:48,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:48,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:48,918 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:48,925 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 05:17:48,933 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:48,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:48,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:48,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 05:17:48,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:48,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 05:17:48,966 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,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 05:17:48,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:48,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:48,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:48,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:48,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,992 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:48,992 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:17:48,994 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 05:17:48,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:48,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:49,145 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:49,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:17:49,146 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:49,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:49,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:49,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:49,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-06 05:17:49,146 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 05:17:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash 404658152, now seen corresponding path program 1 times [2022-12-06 05:17:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:49,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430311660] [2022-12-06 05:17:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:49,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 05:17:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:49,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430311660] [2022-12-06 05:17:49,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430311660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:49,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:49,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:49,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652883145] [2022-12-06 05:17:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:49,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:49,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:49,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:49,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:49,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:49,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:49,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:49,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:49,476 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:49,476 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:49,482 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 05:17:49,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:49,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:49,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:49,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 05:17:49,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:49,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 05:17:49,525 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:49,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 05:17:49,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:49,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:49,526 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:49,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:49,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:49,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:49,551 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:49,551 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:17:49,552 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 05:17:49,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:49,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:49,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:49,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:49,713 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:49,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:49,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:49,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:49,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-06 05:17:49,714 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 05:17:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2147468487, now seen corresponding path program 1 times [2022-12-06 05:17:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:49,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237324884] [2022-12-06 05:17:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:49,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 05:17:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237324884] [2022-12-06 05:17:49,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237324884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:49,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:49,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556923561] [2022-12-06 05:17:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:49,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:49,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:49,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:49,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:49,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 05:17:49,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:49,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:49,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:50,052 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:50,052 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:50,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:50,066 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:50,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:50,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:50,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 05:17:50,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:50,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 05:17:50,100 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,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 05:17:50,100 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:50,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:50,101 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:50,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:50,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,125 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:50,125 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:17:50,126 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 05:17:50,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:50,286 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:50,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:17:50,287 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:50,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 05:17:50,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:50,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 05:17:50,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-06 05:17:50,287 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 05:17:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -404688474, now seen corresponding path program 1 times [2022-12-06 05:17:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:50,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719369294] [2022-12-06 05:17:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:50,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 05:17:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:50,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719369294] [2022-12-06 05:17:50,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719369294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:50,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:50,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250422153] [2022-12-06 05:17:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:50,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:50,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:50,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 05:17:50,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:50,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:50,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:50,626 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:50,626 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:17:50,632 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 05:17:50,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:50,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:50,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:50,641 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:50,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:50,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 05:17:50,672 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,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 05:17:50,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:50,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:50,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:50,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:50,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,698 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:50,698 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:50,699 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 05:17:50,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:50,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:50,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:50,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:50,855 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:50,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 05:17:50,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:50,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 05:17:50,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-06 05:17:50,855 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 05:17:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1338121861, now seen corresponding path program 1 times [2022-12-06 05:17:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:50,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935880281] [2022-12-06 05:17:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:50,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:50,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 05:17:50,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:50,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935880281] [2022-12-06 05:17:50,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935880281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:50,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:50,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:50,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056578073] [2022-12-06 05:17:50,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:50,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:50,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:50,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:50,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:50,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 05:17:50,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:50,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:51,276 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:51,277 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:51,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:51,299 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:51,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:51,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:51,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 05:17:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:51,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:51,344 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,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 05:17:51,345 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:51,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:51,345 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:51,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:51,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,370 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:51,370 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:51,371 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 05:17:51,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:51,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:51,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:51,527 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:51,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:51,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:51,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:51,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-06 05:17:51,528 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 05:17:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1214035100, now seen corresponding path program 1 times [2022-12-06 05:17:51,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:51,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441258362] [2022-12-06 05:17:51,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:51,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:51,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441258362] [2022-12-06 05:17:51,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441258362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:51,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:51,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:51,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708023465] [2022-12-06 05:17:51,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:51,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:51,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:51,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 05:17:51,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:51,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:51,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:51,882 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:51,882 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:51,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 05:17:51,896 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:51,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:51,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:51,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 05:17:51,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:51,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 05:17:51,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,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 05:17:51,929 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:51,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:51,929 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:51,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:51,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:51,954 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:17:51,955 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 05:17:51,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:51,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:52,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:52,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:17:52,097 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17: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 05:17:52,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17: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 05:17:52,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-06 05:17:52,098 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 05:17:52,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash 528775235, now seen corresponding path program 1 times [2022-12-06 05:17:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:52,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414908099] [2022-12-06 05:17:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:52,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 05:17:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:52,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414908099] [2022-12-06 05:17:52,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414908099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:52,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:52,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338786494] [2022-12-06 05:17:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:52,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:52,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:52,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:52,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:52,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:52,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 05:17:52,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:52,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:52,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:52,435 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:52,435 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:17:52,441 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 05:17:52,448 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:52,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:52,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:52,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 05:17:52,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:52,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:52,481 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:52,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:52,481 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:52,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:52,481 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:52,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:52,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:52,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:52,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:52,506 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:52,506 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:17:52,507 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 05:17:52,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:52,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:52,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:52,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:17:52,659 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:52,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 05:17:52,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:52,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 05:17:52,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-06 05:17:52,660 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 05:17:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2023381726, now seen corresponding path program 1 times [2022-12-06 05:17:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:52,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406249917] [2022-12-06 05:17:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:52,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:52,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406249917] [2022-12-06 05:17:52,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406249917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:52,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:52,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116426289] [2022-12-06 05:17:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:52,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:52,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:52,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:52,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:52,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:52,986 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:52,986 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:52,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:52,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:53,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:53,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:53,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 05:17:53,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:53,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:53,031 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,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 05:17:53,031 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:53,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:53,032 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:53,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:53,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,056 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:53,056 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:53,057 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 05:17:53,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:53,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:53,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:17:53,202 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:53,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:53,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:53,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 05:17:53,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-06 05:17:53,202 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 05:17:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -280571391, now seen corresponding path program 1 times [2022-12-06 05:17:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:53,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181895220] [2022-12-06 05:17:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:53,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 05:17:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:53,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181895220] [2022-12-06 05:17:53,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181895220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:53,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:53,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:53,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717231432] [2022-12-06 05:17:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:53,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:53,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:53,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:53,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:53,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 05:17:53,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:53,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:53,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:53,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:53,526 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:17:53,532 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 05:17:53,566 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:53,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:53,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:53,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 05:17:53,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:53,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:53,596 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:53,596 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:53,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:53,596 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:53,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:53,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,621 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:53,621 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:53,622 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 05:17:53,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:53,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:53,771 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:53,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:17:53,772 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:53,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:53,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:53,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:53,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-06 05:17:53,772 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 05:17:53,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:53,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1462238944, now seen corresponding path program 1 times [2022-12-06 05:17:53,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:53,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356472729] [2022-12-06 05:17:53,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:53,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 05:17:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356472729] [2022-12-06 05:17:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356472729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:53,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:53,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503945664] [2022-12-06 05:17:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:53,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:53,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:53,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 05:17:53,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:53,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:53,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:54,130 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:54,130 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:54,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 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 05:17:54,145 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:54,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:54,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:54,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 05:17:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:54,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:54,179 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:54,179 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:54,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:54,179 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,180 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:54,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:54,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,204 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:54,204 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:17:54,205 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 05:17:54,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:54,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:54,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:17:54,347 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:54,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 05:17:54,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:54,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 05:17:54,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-06 05:17:54,348 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 05:17:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1089918017, now seen corresponding path program 1 times [2022-12-06 05:17:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320697216] [2022-12-06 05:17:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:54,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 05:17:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:54,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320697216] [2022-12-06 05:17:54,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320697216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:54,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:54,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037407098] [2022-12-06 05:17:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:54,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:54,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:54,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 05:17:54,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:54,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:54,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:54,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:54,674 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:17:54,681 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 05:17:54,689 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:54,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:54,690 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:54,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 05:17:54,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:54,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 05:17:54,724 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,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 05:17:54,724 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:54,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:54,724 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:54,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:54,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,750 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:54,750 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:17:54,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 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 05:17:54,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:54,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:54,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:54,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:17:54,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:54,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 05:17:54,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:54,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 05:17:54,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-06 05:17:54,913 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 05:17:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 652892318, now seen corresponding path program 1 times [2022-12-06 05:17:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:54,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548305441] [2022-12-06 05:17:54,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:54,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:54,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548305441] [2022-12-06 05:17:54,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548305441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:54,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:54,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811319405] [2022-12-06 05:17:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:54,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:54,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:54,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:54,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:54,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:54,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:55,247 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:55,247 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:17:55,254 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 05:17:55,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:55,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:55,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:55,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:55,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:55,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 05:17:55,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,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 05:17:55,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:55,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:55,298 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:55,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:55,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,324 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:55,324 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:17:55,326 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 05:17:55,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:55,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:55,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:17:55,483 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:55,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 05:17:55,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:55,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 05:17:55,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-06 05:17:55,484 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 05:17:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1899264643, now seen corresponding path program 1 times [2022-12-06 05:17:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:55,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842182493] [2022-12-06 05:17:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:55,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 05:17:55,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:55,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842182493] [2022-12-06 05:17:55,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842182493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:55,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:55,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123116634] [2022-12-06 05:17:55,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:55,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:55,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:55,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:55,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:55,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 05:17:55,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:55,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:55,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:55,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:55,844 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:55,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:17:55,858 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:55,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:55,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:55,860 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:55,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:55,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 05:17:55,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,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 05:17:55,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:55,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:55,894 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:55,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:55,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:55,921 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:55,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 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 05:17:55,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:55,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:56,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:56,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:17:56,083 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:56,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 05:17:56,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:56,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 05:17:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-06 05:17:56,083 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 05:17:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash -156454308, now seen corresponding path program 1 times [2022-12-06 05:17:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:56,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894704192] [2022-12-06 05:17:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:56,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 05:17:56,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:56,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894704192] [2022-12-06 05:17:56,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894704192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:56,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:56,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133515025] [2022-12-06 05:17:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:56,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:56,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:56,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:56,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 05:17:56,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:56,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:56,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:56,407 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:56,407 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:56,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 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 05:17:56,422 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:56,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:56,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:56,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 05:17:56,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:56,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 05:17:56,455 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:56,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 05:17:56,456 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:56,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:56,456 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:56,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:56,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:56,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:56,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:56,482 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:56,482 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:17:56,483 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 05:17:56,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:56,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:56,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:56,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:56,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17: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 05:17:56,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17: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 05:17:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-06 05:17:56,644 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 05:17:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1586356027, now seen corresponding path program 1 times [2022-12-06 05:17:56,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:56,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274385959] [2022-12-06 05:17:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17: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 05:17:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:56,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274385959] [2022-12-06 05:17:56,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274385959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:56,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:56,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486340946] [2022-12-06 05:17:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:56,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:56,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17: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 05:17:56,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:56,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:56,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:56,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:56,989 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:56,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 05:17:57,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:57,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:57,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:57,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:57,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 05:17:57,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:57,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 05:17:57,038 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,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 05:17:57,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:57,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:57,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:57,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:57,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,075 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:57,075 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:17:57,077 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 05:17:57,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:57,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:57,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 05:17:57,274 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:57,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 05:17:57,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:57,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 05:17:57,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2022-12-06 05:17:57,275 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 05:17:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash -965800934, now seen corresponding path program 1 times [2022-12-06 05:17:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:57,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258308272] [2022-12-06 05:17:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:57,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:57,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 05:17:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:57,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258308272] [2022-12-06 05:17:57,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258308272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:57,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:57,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796119402] [2022-12-06 05:17:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:57,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:57,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:57,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 05:17:57,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:57,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:57,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:57,645 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:57,645 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:17:57,651 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 05:17:57,658 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:57,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:57,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:57,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 05:17:57,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:57,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:17:57,688 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:57,688 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:57,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:57,689 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:57,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:57,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,714 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:57,714 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:57,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 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 05:17:57,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:57,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:57,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:57,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:17:57,861 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:57,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 05:17:57,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17: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 05:17:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-06 05:17:57,862 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 05:17:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash 777009401, now seen corresponding path program 1 times [2022-12-06 05:17:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:57,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422635053] [2022-12-06 05:17:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:57,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422635053] [2022-12-06 05:17:57,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422635053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:57,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:57,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105012846] [2022-12-06 05:17:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:57,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:57,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:57,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 05:17:57,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:57,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:57,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:58,190 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:58,190 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:58,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:58,208 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:58,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:58,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:58,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 05:17:58,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:58,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 05:17:58,243 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,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 05:17:58,243 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:58,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:58,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:58,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:58,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,268 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:58,269 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:17:58,270 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 05:17:58,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:58,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:58,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:17:58,408 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:58,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 05:17:58,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:58,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 05:17:58,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-06 05:17:58,409 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 05:17:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1775147560, now seen corresponding path program 1 times [2022-12-06 05:17:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:58,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411332472] [2022-12-06 05:17:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:58,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 05:17:58,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411332472] [2022-12-06 05:17:58,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411332472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:58,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:58,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022511767] [2022-12-06 05:17:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:58,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:58,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:58,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:58,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:58,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 05:17:58,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:58,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:58,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:58,750 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:58,751 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:17:58,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 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 05:17:58,765 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:58,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:58,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:58,766 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:17:58,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:58,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 05:17:58,826 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:17:58,827 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:58,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:58,827 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:58,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:58,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,852 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:17:58,852 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:17:58,853 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 05:17:58,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:58,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:59,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:59,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:17:59,014 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:59,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 05:17:59,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:59,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 05:17:59,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2022-12-06 05:17:59,014 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 05:17:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash -32337225, now seen corresponding path program 1 times [2022-12-06 05:17:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:59,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397509474] [2022-12-06 05:17:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:17:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:59,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397509474] [2022-12-06 05:17:59,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397509474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:59,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:59,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220568521] [2022-12-06 05:17:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:59,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:59,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:59,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:59,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:59,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:59,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:59,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:17:59,467 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:17:59,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:17:59,481 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:17:59,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:17:59,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:17:59,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 05:17:59,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:17:59,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 05:17:59,517 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:59,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 05:17:59,517 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:17:59,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:59,517 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:59,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:59,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:59,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:59,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:59,542 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:17:59,542 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:17:59,544 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 05:17:59,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:17:59,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:17:59,698 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:59,699 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:17:59,699 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:17:59,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:17:59,699 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:59,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:59,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-06 05:17:59,699 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 05:17:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1710473110, now seen corresponding path program 1 times [2022-12-06 05:17:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:59,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663010724] [2022-12-06 05:17:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:59,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 05:17:59,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663010724] [2022-12-06 05:17:59,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663010724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:59,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:59,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114079900] [2022-12-06 05:17:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:59,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:59,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:17:59,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 05:17:59,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:59,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:17:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:00,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:00,091 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:00,098 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 05:18:00,106 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:00,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:00,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:00,107 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:00,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:00,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 05:18:00,144 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,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 05:18:00,144 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:00,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:00,144 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:00,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:00,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,169 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:00,169 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:00,170 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 05:18:00,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:00,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:00,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:18:00,315 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:00,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:00,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:00,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:00,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-06 05:18:00,316 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 05:18:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -841683851, now seen corresponding path program 1 times [2022-12-06 05:18:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640462267] [2022-12-06 05:18:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:00,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 05:18:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640462267] [2022-12-06 05:18:00,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640462267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:00,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380184886] [2022-12-06 05:18:00,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:00,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:00,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:00,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 05:18:00,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:00,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:00,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:00,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:00,682 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:00,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:00,697 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:00,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:00,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:00,698 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:00,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:00,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:00,732 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:00,733 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:00,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:00,733 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:00,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:00,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,758 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:00,758 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:18:00,759 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 05:18:00,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:00,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:00,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:00,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:18:00,900 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:00,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:00,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:00,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 05:18:00,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-06 05:18:00,900 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 05:18:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash 901126484, now seen corresponding path program 1 times [2022-12-06 05:18:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653452959] [2022-12-06 05:18:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:00,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653452959] [2022-12-06 05:18:00,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653452959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:00,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:00,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102915273] [2022-12-06 05:18:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:00,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:00,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:00,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:00,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:00,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:01,248 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:01,248 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:01,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:01,263 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:01,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:01,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:01,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 05:18:01,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:01,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 05:18:01,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,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 05:18:01,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:01,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:01,299 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:01,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:01,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,324 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:01,325 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:18:01,326 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 05:18:01,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:01,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:01,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:18:01,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:01,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 05:18:01,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:01,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:01,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2022-12-06 05:18:01,482 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 05:18:01,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1651030477, now seen corresponding path program 1 times [2022-12-06 05:18:01,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:01,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571134143] [2022-12-06 05:18:01,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571134143] [2022-12-06 05:18:01,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571134143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:01,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:01,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352348544] [2022-12-06 05:18:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:01,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:01,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:01,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:01,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:01,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:01,833 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:01,833 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:01,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 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 05:18:01,847 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:01,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:01,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:01,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 05:18:01,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:01,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 05:18:01,880 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,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 05:18:01,880 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:01,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:01,880 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:01,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:01,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,905 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:01,906 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:18:01,907 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 05:18:01,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:01,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:02,057 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:02,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:02,058 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:02,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 05:18:02,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:02,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 05:18:02,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-06 05:18:02,058 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 05:18:02,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 91779858, now seen corresponding path program 1 times [2022-12-06 05:18:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:02,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336249004] [2022-12-06 05:18:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:02,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 05:18:02,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:02,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336249004] [2022-12-06 05:18:02,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336249004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:02,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:02,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:02,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322741976] [2022-12-06 05:18:02,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:02,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:02,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:02,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:02,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 05:18:02,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:02,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:02,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:02,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:02,425 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:18:02,432 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 05:18:02,441 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:02,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:02,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:02,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 05:18:02,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:02,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 05:18:02,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:02,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:02,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:02,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:02,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:02,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:02,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:02,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:02,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:02,502 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:02,502 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:18:02,503 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 05:18:02,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:02,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:02,645 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:02,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:18:02,645 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:02,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:02,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:02,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 05:18:02,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-06 05:18:02,646 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 05:18:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1834590193, now seen corresponding path program 1 times [2022-12-06 05:18:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:02,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526264526] [2022-12-06 05:18:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:02,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:02,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 05:18:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:02,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526264526] [2022-12-06 05:18:02,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526264526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:02,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:02,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062116362] [2022-12-06 05:18:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:02,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:02,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:02,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:02,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:02,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 05:18:02,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:02,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:02,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:03,003 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:03,003 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18: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 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 05:18:03,015 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:03,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:03,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:03,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 05:18:03,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:03,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 05:18:03,047 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,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 05:18:03,047 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:03,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:03,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:03,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:03,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,072 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:03,072 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:03,074 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 05:18:03,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:03,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:03,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:18:03,216 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:03,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:03,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:03,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:03,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-06 05:18:03,216 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 05:18:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -717566768, now seen corresponding path program 1 times [2022-12-06 05:18:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:03,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497356304] [2022-12-06 05:18:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:03,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497356304] [2022-12-06 05:18:03,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497356304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:03,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:03,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266878554] [2022-12-06 05:18:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:03,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:03,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:03,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:03,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:03,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:03,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:03,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:03,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:03,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:03,555 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:03,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 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 05:18:03,570 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:03,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:03,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:03,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 05:18:03,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:03,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 05:18:03,607 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,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 05:18:03,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:03,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:03,607 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:03,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:03,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,633 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:03,634 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:18:03,635 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 05:18:03,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:03,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:03,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:03,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:18:03,779 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:03,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 05:18:03,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:03,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 05:18:03,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-06 05:18:03,780 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 05:18:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1025243567, now seen corresponding path program 1 times [2022-12-06 05:18:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:03,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206861540] [2022-12-06 05:18:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:03,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:03,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206861540] [2022-12-06 05:18:03,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206861540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:03,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:03,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069536948] [2022-12-06 05:18:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:03,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:03,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:03,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:03,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:03,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:03,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:04,151 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:04,151 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:04,157 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 05:18:04,163 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:04,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:04,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:04,164 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:04,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:04,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 05:18:04,192 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,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 05:18:04,192 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:04,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:04,192 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:04,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:04,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,217 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:04,217 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:18:04,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 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 05:18:04,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:04,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:04,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:18:04,382 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:04,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 05:18:04,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:04,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 05:18:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-06 05:18:04,383 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 05:18:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1526913394, now seen corresponding path program 1 times [2022-12-06 05:18:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:04,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84799021] [2022-12-06 05:18:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:04,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 05:18:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:04,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84799021] [2022-12-06 05:18:04,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84799021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:04,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:04,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:04,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789844097] [2022-12-06 05:18:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:04,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:04,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 05:18:04,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:04,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:04,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:04,734 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:04,734 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:04,741 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 05:18:04,748 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:04,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:04,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:04,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:04,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 05:18:04,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:04,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:04,781 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,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 05:18:04,781 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:04,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:04,782 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:04,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:04,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,807 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:04,807 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:18:04,808 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 05:18:04,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:04,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:04,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:04,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:18:04,963 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:04,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 05:18:04,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:04,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 05:18:04,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-06 05:18:04,963 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 05:18:04,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash 215896941, now seen corresponding path program 1 times [2022-12-06 05:18:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162874413] [2022-12-06 05:18:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:04,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:05,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 05:18:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:05,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162874413] [2022-12-06 05:18:05,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162874413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:05,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:05,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638557723] [2022-12-06 05:18:05,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:05,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:05,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:05,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 05:18:05,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:05,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:05,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:05,301 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:05,301 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:05,308 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 05:18:05,317 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:05,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:05,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:05,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 05:18:05,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:05,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 05:18:05,351 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,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 05:18:05,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:05,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:05,352 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,352 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:05,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:05,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,385 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:05,385 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:05,386 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 05:18:05,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,388 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:05,537 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:05,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:18:05,538 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:05,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:05,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:05,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:05,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-06 05:18:05,538 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 05:18:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:05,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1958707276, now seen corresponding path program 1 times [2022-12-06 05:18:05,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:05,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207873691] [2022-12-06 05:18:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:05,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207873691] [2022-12-06 05:18:05,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207873691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:05,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:05,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155419184] [2022-12-06 05:18:05,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:05,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:05,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:05,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:05,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:05,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:05,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:05,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:05,857 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:05,857 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:05,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 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 05:18:05,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:05,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:05,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:05,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 05:18:05,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:05,905 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,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 05:18:05,905 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:05,905 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:05,905 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:05,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:05,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,930 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:05,930 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:18:05,931 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 05:18:05,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:05,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:06,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:06,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:18:06,093 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:06,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 05:18:06,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:06,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 05:18:06,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-06 05:18:06,093 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 05:18:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -593449685, now seen corresponding path program 1 times [2022-12-06 05:18:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:06,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610854402] [2022-12-06 05:18:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:06,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 05:18:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:06,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610854402] [2022-12-06 05:18:06,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610854402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:06,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:06,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759279994] [2022-12-06 05:18:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:06,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:06,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:06,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:06,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:06,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 05:18:06,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:06,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:06,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:06,427 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:06,427 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:06,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 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 05:18:06,441 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:06,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:06,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:06,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 05:18:06,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:06,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 05:18:06,474 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:06,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 05:18:06,474 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:06,474 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:06,474 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:06,475 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:06,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:06,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:06,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:06,499 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:06,499 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:18:06,500 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 05:18:06,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:06,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:06,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:06,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:18:06,651 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:06,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 05:18:06,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:06,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 05:18:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2022-12-06 05:18:06,652 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 05:18:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1149360650, now seen corresponding path program 1 times [2022-12-06 05:18:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:06,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275494520] [2022-12-06 05:18:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:06,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:06,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 05:18:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275494520] [2022-12-06 05:18:06,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275494520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:06,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:06,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804279618] [2022-12-06 05:18:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:06,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:06,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:06,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:06,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:06,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 05:18:06,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:06,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:06,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:07,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:07,056 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:07,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:07,076 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:07,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:07,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:07,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 05:18:07,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:07,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 05:18:07,121 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,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 05:18:07,122 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:07,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:07,122 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:07,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:07,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,156 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:07,156 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:07,157 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 05:18:07,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:07,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:07,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 05:18:07,351 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:07,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:07,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:07,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:07,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2022-12-06 05:18:07,351 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 05:18:07,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1402796311, now seen corresponding path program 1 times [2022-12-06 05:18:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:07,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042999760] [2022-12-06 05:18:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:07,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 05:18:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:07,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042999760] [2022-12-06 05:18:07,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042999760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:07,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:07,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:07,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660350185] [2022-12-06 05:18:07,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:07,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:07,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:07,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 05:18:07,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:07,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:07,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:07,667 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:07,667 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:07,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 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 05:18:07,682 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:07,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:07,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:07,683 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:07,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 05:18:07,717 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,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 05:18:07,717 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:07,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:07,717 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:07,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:07,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,742 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:07,742 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:07,743 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 05:18:07,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:07,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:07,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:07,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:18:07,888 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:07,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 05:18:07,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:07,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 05:18:07,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2022-12-06 05:18:07,889 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 05:18:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash 340014024, now seen corresponding path program 1 times [2022-12-06 05:18:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:07,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542190141] [2022-12-06 05:18:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:07,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:07,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542190141] [2022-12-06 05:18:07,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542190141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:07,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:07,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625895133] [2022-12-06 05:18:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:07,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:07,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:07,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 05:18:07,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:07,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:07,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:08,235 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:08,235 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:08,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:08,247 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:08,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:08,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:08,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 05:18:08,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:08,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 05:18:08,279 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,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 05:18:08,279 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:08,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:08,279 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,279 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:08,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:08,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,304 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:08,304 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:18:08,305 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 05:18:08,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:08,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:08,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:08,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:08,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 05:18:08,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:08,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 05:18:08,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2022-12-06 05:18:08,457 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 05:18:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2082824359, now seen corresponding path program 1 times [2022-12-06 05:18:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:08,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772922208] [2022-12-06 05:18:08,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772922208] [2022-12-06 05:18:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772922208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:08,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436438784] [2022-12-06 05:18:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:08,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:08,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:08,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 05:18:08,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:08,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:08,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:08,770 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:08,770 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:08,777 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 05:18:08,784 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:08,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:08,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:08,785 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:08,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:08,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 05:18:08,817 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,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 05:18:08,817 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:08,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:08,817 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:08,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:08,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,842 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:08,842 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:18:08,843 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 05:18:08,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:08,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:08,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:08,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:18:08,985 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:08,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 05:18:08,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:08,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 05:18:08,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2022-12-06 05:18:08,986 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 05:18:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -469332602, now seen corresponding path program 1 times [2022-12-06 05:18:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:08,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106527082] [2022-12-06 05:18:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:09,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106527082] [2022-12-06 05:18:09,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106527082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:09,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:09,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845751848] [2022-12-06 05:18:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:09,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:09,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:09,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:09,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:09,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:09,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:09,330 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:09,330 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:09,336 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 05:18:09,342 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:09,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:09,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:09,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:09,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 05:18:09,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:09,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 05:18:09,370 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,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 05:18:09,370 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:09,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:09,370 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:09,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:09,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,395 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:09,395 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:18:09,396 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 05:18:09,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:09,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:09,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:18:09,534 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:09,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:09,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:09,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:09,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2022-12-06 05:18:09,534 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 05:18:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1273477733, now seen corresponding path program 1 times [2022-12-06 05:18:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:09,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499523096] [2022-12-06 05:18:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:09,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 05:18:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499523096] [2022-12-06 05:18:09,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499523096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:09,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:09,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359997440] [2022-12-06 05:18:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:09,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:09,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:09,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:09,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:09,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:09,862 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:09,862 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:09,869 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 05:18:09,876 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:09,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:09,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:09,877 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:09,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:09,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 05:18:09,908 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:09,908 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:09,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:09,908 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:09,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:09,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,932 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:09,933 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:18:09,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 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 05:18:09,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:09,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:10,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:10,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:18:10,081 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:10,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 05:18:10,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:10,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 05:18:10,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2022-12-06 05:18:10,081 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 05:18:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1278679228, now seen corresponding path program 1 times [2022-12-06 05:18:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:10,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174117181] [2022-12-06 05:18:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:10,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 05:18:10,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174117181] [2022-12-06 05:18:10,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174117181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:10,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:10,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427716688] [2022-12-06 05:18:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:10,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:10,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:10,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 05:18:10,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:10,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:10,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:10,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:10,423 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:10,430 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 05:18:10,437 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:10,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:10,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:10,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 05:18:10,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:10,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 05:18:10,471 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:10,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 05:18:10,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:10,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:10,472 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:10,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:10,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:10,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:10,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:10,505 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:10,505 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 05:18:10,506 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 05:18:10,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:10,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:10,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:10,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:18:10,649 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:10,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:10,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:10,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2022-12-06 05:18:10,650 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 05:18:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:10,650 INFO L85 PathProgramCache]: Analyzing trace with hash 464131107, now seen corresponding path program 1 times [2022-12-06 05:18:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:10,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690024332] [2022-12-06 05:18:10,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690024332] [2022-12-06 05:18:10,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690024332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:10,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:10,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081331085] [2022-12-06 05:18:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:10,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:10,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:10,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:10,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:10,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:10,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:10,997 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:10,997 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:11,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 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 05:18:11,011 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:11,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:11,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:11,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 05:18:11,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:11,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:11,044 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:11,045 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:11,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:11,045 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:11,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:11,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,069 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:11,069 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:18:11,070 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 05:18:11,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:11,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:11,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:18:11,227 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:11,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 05:18:11,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:11,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 05:18:11,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2022-12-06 05:18:11,228 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 05:18:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2088025854, now seen corresponding path program 1 times [2022-12-06 05:18:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871377234] [2022-12-06 05:18:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:11,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 05:18:11,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:11,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871377234] [2022-12-06 05:18:11,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871377234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:11,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:11,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948951511] [2022-12-06 05:18:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:11,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:11,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:11,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:11,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:11,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:11,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:11,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:11,543 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:11,543 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:11,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:11,557 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:11,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:11,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:11,558 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:11,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:11,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 05:18:11,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,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 05:18:11,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:11,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:11,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:11,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:11,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,615 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:11,615 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:18:11,616 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 05:18:11,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:11,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:11,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:11,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:18:11,767 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:11,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 05:18:11,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:11,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 05:18:11,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2022-12-06 05:18:11,768 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 05:18:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash -345215519, now seen corresponding path program 1 times [2022-12-06 05:18:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6072531] [2022-12-06 05:18:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:11,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 05:18:11,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:11,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6072531] [2022-12-06 05:18:11,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6072531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:11,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:11,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:11,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66324148] [2022-12-06 05:18:11,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:11,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:11,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:11,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:11,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:11,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:11,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:11,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:12,107 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:12,107 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:12,114 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 05:18:12,122 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:12,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:12,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:12,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 05:18:12,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:12,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 05:18:12,155 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,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 05:18:12,155 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:12,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:12,155 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:12,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:12,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,182 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:12,183 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:12,184 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 05:18:12,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:12,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:12,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:18:12,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:12,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 05:18:12,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:12,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 05:18:12,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2022-12-06 05:18:12,341 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 05:18:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1397594816, now seen corresponding path program 1 times [2022-12-06 05:18:12,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:12,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893226405] [2022-12-06 05:18:12,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:12,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 05:18:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:12,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893226405] [2022-12-06 05:18:12,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893226405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:12,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:12,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148699378] [2022-12-06 05:18:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:12,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:12,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:12,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 05:18:12,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:12,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:12,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:12,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:12,674 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:12,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 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 05:18:12,688 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:12,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:12,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:12,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 05:18:12,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:12,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 05:18:12,722 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,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 05:18:12,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:12,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:12,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:12,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:12,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,747 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:12,747 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:18:12,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 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 05:18:12,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:12,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:12,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:12,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:18:12,887 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:12,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 05:18:12,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:12,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 05:18:12,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2022-12-06 05:18:12,887 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 05:18:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1154562145, now seen corresponding path program 1 times [2022-12-06 05:18:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961891884] [2022-12-06 05:18:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:12,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 05:18:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:12,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961891884] [2022-12-06 05:18:12,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961891884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:12,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:12,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953239654] [2022-12-06 05:18:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:12,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:12,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:12,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 05:18:12,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:12,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:13,237 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:13,237 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:13,243 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 05:18:13,249 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:13,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:13,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:13,250 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:13,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:13,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 05:18:13,279 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,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 05:18:13,279 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:13,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:13,279 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:13,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:13,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,304 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:13,304 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:18:13,305 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 05:18:13,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:13,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:13,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:13,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:13,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 05:18:13,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:13,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 05:18:13,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2022-12-06 05:18:13,458 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 05:18:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash 588248190, now seen corresponding path program 1 times [2022-12-06 05:18:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:13,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422397408] [2022-12-06 05:18:13,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:13,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18: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 05:18:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:13,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422397408] [2022-12-06 05:18:13,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422397408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:13,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:13,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048013065] [2022-12-06 05:18:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:13,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:13,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18: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 05:18:13,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:13,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:13,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:13,798 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:13,798 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:18:13,804 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 05:18:13,812 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:13,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:13,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:13,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 05:18:13,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:13,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 05:18:13,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,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 05:18:13,843 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:13,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:13,843 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:13,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:13,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,867 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:13,867 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:18:13,868 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 05:18:13,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:13,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:14,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:14,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:18:14,009 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:14,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 05:18:14,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:14,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 05:18:14,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2022-12-06 05:18:14,009 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 05:18:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1963908771, now seen corresponding path program 1 times [2022-12-06 05:18:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:14,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201981662] [2022-12-06 05:18:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:14,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 05:18:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:14,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201981662] [2022-12-06 05:18:14,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201981662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:14,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:14,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263582445] [2022-12-06 05:18:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:14,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:14,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:14,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 05:18:14,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:14,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:14,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:14,369 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:14,369 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:18:14,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 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 05:18:14,380 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:14,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:14,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:14,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 05:18:14,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:14,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:14,410 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:14,410 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:14,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:14,410 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:14,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:14,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,435 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:14,436 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:14,437 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 05:18:14,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:14,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:14,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:18:14,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:14,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 05:18:14,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:14,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 05:18:14,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2022-12-06 05:18:14,601 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 05:18:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash -221098436, now seen corresponding path program 1 times [2022-12-06 05:18:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:14,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422947760] [2022-12-06 05:18:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:14,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422947760] [2022-12-06 05:18:14,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422947760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:14,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:14,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934841457] [2022-12-06 05:18:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:14,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:14,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:14,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:14,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:14,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:14,920 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:14,920 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:14,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:14,934 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:14,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:14,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:14,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 05:18:14,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:14,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:14,974 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:14,975 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:14,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:14,975 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:14,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:14,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:14,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,000 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:15,000 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:18:15,001 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 05:18:15,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:15,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:15,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:18:15,168 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:15,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 05:18:15,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:15,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 05:18:15,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2022-12-06 05:18:15,168 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 05:18:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:15,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1521711899, now seen corresponding path program 1 times [2022-12-06 05:18:15,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:15,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578881340] [2022-12-06 05:18:15,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:15,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 05:18:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:15,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578881340] [2022-12-06 05:18:15,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578881340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:15,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:15,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797358601] [2022-12-06 05:18:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:15,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:15,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:15,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 05:18:15,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:15,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:15,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:15,526 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:15,527 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:15,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 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 05:18:15,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:15,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:15,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18: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 05:18:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:15,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:15,572 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:15,572 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:15,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:15,573 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:15,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:15,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,605 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:15,606 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:18:15,607 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 05:18:15,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:15,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:15,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:15,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:18:15,748 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:15,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 05:18:15,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:15,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 05:18:15,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2022-12-06 05:18:15,748 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 05:18:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1030445062, now seen corresponding path program 1 times [2022-12-06 05:18:15,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:15,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719696429] [2022-12-06 05:18:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:15,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 05:18:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719696429] [2022-12-06 05:18:15,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719696429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:15,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:15,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602334058] [2022-12-06 05:18:15,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:15,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:15,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:15,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 05:18:15,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:15,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:15,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:16,077 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:16,078 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:16,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 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 05:18:16,092 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:16,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:16,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:16,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 05:18:16,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:16,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 05:18:16,125 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,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 05:18:16,125 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:16,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:16,126 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:16,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:16,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,151 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:16,151 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:16,152 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 05:18:16,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:16,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:16,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:18:16,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:16,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:16,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:16,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:16,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2022-12-06 05:18:16,302 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 05:18:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 712365273, now seen corresponding path program 1 times [2022-12-06 05:18:16,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:16,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447925054] [2022-12-06 05:18:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:16,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 05:18:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:16,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447925054] [2022-12-06 05:18:16,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447925054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:16,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:16,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110431063] [2022-12-06 05:18:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:16,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:16,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:16,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:16,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:16,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:16,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 05:18:16,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:16,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:16,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:16,633 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:16,633 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:16,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:16,647 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:16,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:16,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18: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 05:18:16,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:16,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 05:18:16,680 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,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 05:18:16,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:16,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:16,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:16,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:16,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,706 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:16,706 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:16,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 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 05:18:16,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:16,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:16,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:16,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:16,867 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:16,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 05:18:16,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:16,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 05:18:16,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2022-12-06 05:18:16,868 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 05:18:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1839791688, now seen corresponding path program 1 times [2022-12-06 05:18:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:16,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510990827] [2022-12-06 05:18:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:16,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 05:18:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510990827] [2022-12-06 05:18:16,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510990827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:16,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:16,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303384158] [2022-12-06 05:18:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:16,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:16,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:16,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:16,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:16,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:16,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:17,192 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:17,192 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:18:17,199 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 05:18:17,207 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:17,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:17,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:17,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 05:18:17,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:17,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 05:18:17,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,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 05:18:17,242 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:17,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:17,242 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:17,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:17,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,267 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:17,267 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:18:17,268 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 05:18:17,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:17,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:17,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:18:17,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:17,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 05:18:17,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:17,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 05:18:17,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2022-12-06 05:18:17,422 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 05:18:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -96981353, now seen corresponding path program 1 times [2022-12-06 05:18:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:17,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032083619] [2022-12-06 05:18:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:17,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 05:18:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:17,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032083619] [2022-12-06 05:18:17,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032083619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:17,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:17,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592829064] [2022-12-06 05:18:17,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:17,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:17,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:17,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:17,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 05:18:17,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:17,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:17,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:17,766 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:17,766 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:17,774 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 05:18:17,782 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:17,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:17,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:17,783 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:17,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:17,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 05:18:17,826 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:17,826 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:17,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:17,827 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:17,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:17,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,854 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:17,854 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:17,856 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 05:18:17,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:17,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:18,021 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:18,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:18:18,022 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:18,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:18,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:18,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2022-12-06 05:18:18,022 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 05:18:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1645828982, now seen corresponding path program 1 times [2022-12-06 05:18:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:18,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516702323] [2022-12-06 05:18:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516702323] [2022-12-06 05:18:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516702323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:18,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021080578] [2022-12-06 05:18:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:18,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:18,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:18,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:18,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:18,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:18,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:18,353 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:18,359 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 05:18:18,366 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:18,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:18,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:18,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 05:18:18,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:18,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 05:18:18,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,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 05:18:18,397 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:18,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:18,397 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:18,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:18,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,424 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:18,424 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:18:18,425 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 05:18:18,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:18,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:18,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:18:18,578 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:18,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 05:18:18,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:18,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 05:18:18,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2022-12-06 05:18:18,578 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 05:18:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash -906327979, now seen corresponding path program 1 times [2022-12-06 05:18:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:18,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749098968] [2022-12-06 05:18:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:18,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 05:18:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:18,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749098968] [2022-12-06 05:18:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749098968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:18,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214214503] [2022-12-06 05:18:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:18,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:18,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:18,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:18,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:18,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:18,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:18,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:18,904 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:18,905 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:18,911 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 05:18:18,919 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:18,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:18,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:18,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 05:18:18,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:18,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 05:18:18,954 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:18,954 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:18,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:18,954 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:18,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:18,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,980 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:18,980 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:18,981 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 05:18:18,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:18,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:19,133 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:19,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:18:19,133 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:19,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 05:18:19,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:19,134 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:19,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2022-12-06 05:18:19,134 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 05:18:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 836482356, now seen corresponding path program 1 times [2022-12-06 05:18:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:19,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782573480] [2022-12-06 05:18:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:19,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782573480] [2022-12-06 05:18:19,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782573480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:19,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:19,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434049919] [2022-12-06 05:18:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:19,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:19,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:19,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:19,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:19,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:19,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:19,501 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:19,502 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:18:19,507 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 05:18:19,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:19,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:19,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:19,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 05:18:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:19,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 05:18:19,541 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:19,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 05:18:19,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:19,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:19,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:19,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:19,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:19,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:19,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:19,579 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:19,579 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:18:19,581 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 05:18:19,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:19,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:19,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:19,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:18:19,757 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:19,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:19,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:19,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:19,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2022-12-06 05:18:19,757 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 05:18:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1715674605, now seen corresponding path program 1 times [2022-12-06 05:18:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:19,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337207002] [2022-12-06 05:18:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:19,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:19,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337207002] [2022-12-06 05:18:19,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337207002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:19,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:19,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563670501] [2022-12-06 05:18:19,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:19,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:19,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:19,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:19,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 05:18:19,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:19,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:20,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:20,117 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:20,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 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 05:18:20,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:20,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:20,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:20,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 05:18:20,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:20,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 05:18:20,167 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,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 05:18:20,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:20,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:20,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:20,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:20,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,193 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:20,193 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:18:20,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 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 05:18:20,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:20,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:20,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:20,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:20,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 05:18:20,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:20,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 05:18:20,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2022-12-06 05:18:20,345 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 05:18:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash 27135730, now seen corresponding path program 1 times [2022-12-06 05:18:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:20,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490783224] [2022-12-06 05:18:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:20,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 05:18:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:20,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490783224] [2022-12-06 05:18:20,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490783224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:20,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:20,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91902452] [2022-12-06 05:18:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:20,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:20,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:20,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:20,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:20,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:20,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:20,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:20,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:20,688 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:20,688 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:20,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:20,703 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:20,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:20,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:20,704 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:20,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:20,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:20,737 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,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 05:18:20,737 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:20,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:20,737 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:20,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:20,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,763 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:20,763 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:18:20,764 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 05:18:20,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:20,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:20,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:20,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:18:20,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:20,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 05:18:20,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:20,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 05:18:20,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2022-12-06 05:18:20,913 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 05:18:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1769946065, now seen corresponding path program 1 times [2022-12-06 05:18:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:20,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124501794] [2022-12-06 05:18:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:20,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124501794] [2022-12-06 05:18:20,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124501794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:20,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:20,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455384412] [2022-12-06 05:18:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:20,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:20,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:20,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:20,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:20,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 05:18:20,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:20,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:20,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:21,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:21,280 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:21,288 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 05:18:21,297 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:21,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:21,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:21,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 05:18:21,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:21,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:21,345 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:21,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 05:18:21,345 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:21,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:21,345 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:21,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:21,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:21,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:21,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:21,379 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:21,379 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:21,381 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 05:18:21,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:21,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:21,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:21,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 05:18:21,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:21,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 05:18:21,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:21,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 05:18:21,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2022-12-06 05:18:21,587 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 05:18:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -782210896, now seen corresponding path program 1 times [2022-12-06 05:18:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:21,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990084663] [2022-12-06 05:18:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:21,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990084663] [2022-12-06 05:18:21,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990084663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:21,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:21,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615848733] [2022-12-06 05:18:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:21,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:21,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:21,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:21,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 05:18:21,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:21,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:22,042 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:22,042 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:22,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:22,062 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:22,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:22,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:22,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 05:18:22,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:22,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 05:18:22,110 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,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 05:18:22,110 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:22,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:22,110 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:22,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:22,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,145 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:22,145 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:18:22,147 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 05:18:22,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:22,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:22,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 05:18:22,336 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:22,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 05:18:22,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:22,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 05:18:22,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2022-12-06 05:18:22,337 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 05:18:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 960599439, now seen corresponding path program 1 times [2022-12-06 05:18:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:22,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665112892] [2022-12-06 05:18:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:22,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 05:18:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665112892] [2022-12-06 05:18:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665112892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:22,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:22,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26853887] [2022-12-06 05:18:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:22,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:22,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:22,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:22,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 05:18:22,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:22,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:22,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:22,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:22,691 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:22,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:22,706 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:22,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:22,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:22,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 05:18:22,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:22,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 05:18:22,740 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,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 05:18:22,741 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:22,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:22,741 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:22,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:22,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,766 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:22,766 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:18:22,767 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 05:18:22,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:22,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:22,933 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:22,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:18:22,934 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:22,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 05:18:22,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:22,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 05:18:22,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2022-12-06 05:18:22,934 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 05:18:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:22,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1591557522, now seen corresponding path program 1 times [2022-12-06 05:18:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:22,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008949377] [2022-12-06 05:18:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:22,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008949377] [2022-12-06 05:18:22,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008949377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:22,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:22,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001164103] [2022-12-06 05:18:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:22,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:22,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:22,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:22,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 05:18:22,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:22,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:22,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:23,274 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:23,275 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:23,281 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 05:18:23,289 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:23,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:23,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:23,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 05:18:23,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:23,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 05:18:23,324 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,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 05:18:23,324 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:23,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:23,324 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:23,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:23,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,350 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:23,350 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:18:23,351 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 05:18:23,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:23,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:23,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:23,503 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:23,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 05:18:23,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:23,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 05:18:23,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2022-12-06 05:18:23,503 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 05:18:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 151252813, now seen corresponding path program 1 times [2022-12-06 05:18:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:23,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166728232] [2022-12-06 05:18:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:23,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 05:18:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:23,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166728232] [2022-12-06 05:18:23,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166728232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:23,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:23,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575841053] [2022-12-06 05:18:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:23,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:23,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 05:18:23,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:23,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:23,858 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:23,858 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:23,864 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 05:18:23,870 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:23,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:23,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:23,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:23,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 05:18:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:23,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 05:18:23,900 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,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 05:18:23,900 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:23,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:23,900 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:23,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:23,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,925 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:23,925 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:18:23,926 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 05:18:23,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:23,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:24,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:24,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:18:24,083 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:24,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 05:18:24,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:24,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 05:18:24,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2022-12-06 05:18:24,083 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 05:18:24,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1894063148, now seen corresponding path program 1 times [2022-12-06 05:18:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:24,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590945219] [2022-12-06 05:18:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:24,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:24,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 05:18:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590945219] [2022-12-06 05:18:24,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590945219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:24,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:24,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845031491] [2022-12-06 05:18:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:24,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:24,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:24,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 05:18:24,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:24,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:24,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:24,437 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:24,437 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:24,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 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 05:18:24,450 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:24,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:24,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:24,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 05:18:24,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:24,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:24,482 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:24,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:24,483 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:24,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:24,483 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:24,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:24,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:24,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:24,508 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:24,508 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:18:24,509 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 05:18:24,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:24,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:24,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:24,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:24,669 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:24,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:24,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:24,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2022-12-06 05:18:24,669 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 05:18:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash -658093813, now seen corresponding path program 1 times [2022-12-06 05:18:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:24,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005369772] [2022-12-06 05:18:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:24,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 05:18:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005369772] [2022-12-06 05:18:24,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005369772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:24,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:24,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818874729] [2022-12-06 05:18:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:24,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:24,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:24,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:24,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:24,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 05:18:24,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:24,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:24,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:25,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:25,048 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:25,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 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 05:18:25,060 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:25,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:25,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:25,061 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:25,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:25,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 05:18:25,089 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,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 05:18:25,090 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:25,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:25,090 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:25,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:25,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,116 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:25,116 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:18:25,117 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 05:18:25,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:25,271 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:25,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:18:25,271 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:25,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:25,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:25,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:25,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2022-12-06 05:18:25,271 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 05:18:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1084716522, now seen corresponding path program 1 times [2022-12-06 05:18:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:25,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186250375] [2022-12-06 05:18:25,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:25,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 05:18:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:25,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186250375] [2022-12-06 05:18:25,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186250375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:25,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:25,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280556295] [2022-12-06 05:18:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:25,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:25,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:25,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 05:18:25,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:25,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:25,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:25,610 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:25,610 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:25,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 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 05:18:25,625 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:25,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:25,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:25,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 05:18:25,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:25,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 05:18:25,659 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,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 05:18:25,660 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:25,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:25,660 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:25,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:25,660 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,686 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:25,686 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:25,687 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 05:18:25,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:25,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:25,835 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:25,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:18:25,836 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:25,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 05:18:25,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:25,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 05:18:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2022-12-06 05:18:25,836 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 05:18:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1467440439, now seen corresponding path program 1 times [2022-12-06 05:18:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:25,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074055219] [2022-12-06 05:18:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:25,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074055219] [2022-12-06 05:18:25,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074055219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:25,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:25,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652896024] [2022-12-06 05:18:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:25,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:25,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:25,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:25,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:25,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:25,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:25,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:26,211 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:26,211 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:26,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:26,226 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:26,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:26,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:26,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:26,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 05:18:26,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:26,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 05:18:26,263 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,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 05:18:26,263 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:26,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:26,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:26,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:26,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,301 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:26,301 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:18:26,303 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 05:18:26,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:26,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:26,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 05:18:26,475 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:26,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:26,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:26,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:26,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2022-12-06 05:18:26,475 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 05:18:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 275369896, now seen corresponding path program 1 times [2022-12-06 05:18:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:26,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204193648] [2022-12-06 05:18:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:26,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 05:18:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:26,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204193648] [2022-12-06 05:18:26,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204193648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:26,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:26,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727506848] [2022-12-06 05:18:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:26,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:26,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:26,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:26,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 05:18:26,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:26,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:26,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:26,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:26,832 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:26,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 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 05:18:26,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:26,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:26,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:26,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 05:18:26,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:26,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:26,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,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 05:18:26,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:26,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:26,884 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:26,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:26,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,912 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:26,912 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:18:26,913 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 05:18:26,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:26,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:27,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:27,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:18:27,064 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:27,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:27,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:27,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:27,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2022-12-06 05:18:27,064 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 05:18:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2018180231, now seen corresponding path program 1 times [2022-12-06 05:18:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085405372] [2022-12-06 05:18:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:27,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 05:18:27,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:27,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085405372] [2022-12-06 05:18:27,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085405372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:27,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:27,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072441236] [2022-12-06 05:18:27,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:27,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:27,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:27,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:27,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:27,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:27,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:27,404 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:27,404 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:27,411 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 05:18:27,418 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:27,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:27,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:27,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 05:18:27,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18: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 05:18:27,451 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18: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 05:18:27,451 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:27,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:27,451 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:27,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:27,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:27,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:27,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:27,476 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:27,476 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:27,477 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 05:18:27,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:27,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:27,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:27,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:18:27,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:27,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 05:18:27,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:27,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 05:18:27,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2022-12-06 05:18:27,624 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 05:18:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash -533976730, now seen corresponding path program 1 times [2022-12-06 05:18:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:27,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585244167] [2022-12-06 05:18:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:27,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585244167] [2022-12-06 05:18:27,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585244167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:27,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:27,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:27,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100139244] [2022-12-06 05:18:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:27,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:27,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:27,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:27,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:27,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:27,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:27,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:27,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:27,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:27,989 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:27,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 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 05:18:28,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:28,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:28,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:28,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 05:18:28,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:28,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 05:18:28,044 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:28,044 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:28,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:28,044 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:28,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:28,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,072 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:28,073 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:28,074 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 05:18:28,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:28,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:28,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:28,230 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:28,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 05:18:28,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:28,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 05:18:28,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2022-12-06 05:18:28,231 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 05:18:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1208833605, now seen corresponding path program 1 times [2022-12-06 05:18:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534003655] [2022-12-06 05:18:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:28,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 05:18:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:28,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534003655] [2022-12-06 05:18:28,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534003655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:28,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:28,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120165697] [2022-12-06 05:18:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:28,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:28,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:28,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 05:18:28,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:28,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:28,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:28,562 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:28,562 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:28,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:28,577 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:28,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:28,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:28,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 05:18:28,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:28,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 05:18:28,609 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,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 05:18:28,609 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:28,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:28,610 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:28,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:28,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,634 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:28,635 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:28,636 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 05:18:28,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:28,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:28,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:28,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:18:28,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:28,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:28,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:28,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:28,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2022-12-06 05:18:28,777 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 05:18:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1343323356, now seen corresponding path program 1 times [2022-12-06 05:18:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:28,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678460167] [2022-12-06 05:18:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:28,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 05:18:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:28,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678460167] [2022-12-06 05:18:28,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678460167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:28,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:28,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467274569] [2022-12-06 05:18:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:28,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:28,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:28,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 05:18:28,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:28,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:28,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:29,132 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:29,132 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:29,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:29,145 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:29,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:29,145 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:29,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 05:18:29,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:29,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 05:18:29,175 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,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 05:18:29,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:29,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:29,176 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:29,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:29,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,200 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:29,201 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:18:29,201 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 05:18:29,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:29,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:29,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:18:29,344 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:29,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 05:18:29,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:29,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 05:18:29,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2022-12-06 05:18:29,345 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 05:18:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash 399486979, now seen corresponding path program 1 times [2022-12-06 05:18:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:29,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090813718] [2022-12-06 05:18:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:29,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090813718] [2022-12-06 05:18:29,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090813718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:29,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:29,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717522292] [2022-12-06 05:18:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:29,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:29,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:29,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:29,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:29,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:29,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:29,690 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:29,690 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:29,697 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 05:18:29,704 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:29,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:29,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:29,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 05:18:29,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:29,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 05:18:29,739 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:29,739 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:29,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:29,739 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:29,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:29,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,764 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:29,764 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:18:29,765 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 05:18:29,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:29,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:29,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:29,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:18:29,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:29,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 05:18:29,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:29,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 05:18:29,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2022-12-06 05:18:29,928 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 05:18:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2142297314, now seen corresponding path program 1 times [2022-12-06 05:18:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:29,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38209703] [2022-12-06 05:18:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:29,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 05:18:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:29,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38209703] [2022-12-06 05:18:29,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38209703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:29,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:29,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726049456] [2022-12-06 05:18:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:29,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:29,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:29,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 05:18:29,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:29,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:29,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:30,285 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:30,285 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:30,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 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 05:18:30,296 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:30,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:30,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:30,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 05:18:30,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:30,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:30,325 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:30,325 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:30,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:30,325 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:30,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:30,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,351 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:30,351 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:30,352 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 05:18:30,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:30,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:30,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:18:30,513 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:30,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 05:18:30,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:30,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 05:18:30,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2022-12-06 05:18:30,513 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 05:18:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -409859647, now seen corresponding path program 1 times [2022-12-06 05:18:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053606999] [2022-12-06 05:18:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:30,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 05:18:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053606999] [2022-12-06 05:18:30,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053606999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:30,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:30,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670073711] [2022-12-06 05:18:30,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:30,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:30,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:30,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:30,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:30,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 05:18:30,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:30,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:30,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:30,837 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:30,837 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:30,843 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 05:18:30,851 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:30,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:30,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:30,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 05:18:30,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:30,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 05:18:30,882 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,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 05:18:30,882 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:30,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:30,882 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:30,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:30,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,908 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:30,908 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:18:30,909 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 05:18:30,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:30,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:31,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:31,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:18:31,059 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:31,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:31,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:31,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:31,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2022-12-06 05:18:31,059 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 05:18:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1332950688, now seen corresponding path program 1 times [2022-12-06 05:18:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:31,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081741903] [2022-12-06 05:18:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:31,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 05:18:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:31,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081741903] [2022-12-06 05:18:31,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081741903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:31,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:31,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435019909] [2022-12-06 05:18:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:31,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:31,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:31,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:31,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 05:18:31,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:31,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:31,432 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:31,432 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:31,441 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 05:18:31,450 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:31,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:31,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:31,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 05:18:31,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:31,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 05:18:31,493 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:31,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 05:18:31,493 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:31,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:31,493 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:31,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:31,494 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:31,494 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:31,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:31,525 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:31,525 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 05:18:31,526 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 05:18:31,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:31,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:31,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:31,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:18:31,685 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:31,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:31,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:31,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:31,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2022-12-06 05:18:31,685 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 05:18:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1219206273, now seen corresponding path program 1 times [2022-12-06 05:18:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:31,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930137498] [2022-12-06 05:18:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:31,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:31,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930137498] [2022-12-06 05:18:31,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930137498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:31,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:31,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068915212] [2022-12-06 05:18:31,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:31,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:31,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:31,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:31,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 05:18:31,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:31,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:31,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:32,051 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:32,051 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:32,057 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 05:18:32,065 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:32,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:32,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:32,066 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:32,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:32,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 05:18:32,098 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,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 05:18:32,098 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:32,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:32,098 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,099 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:32,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:32,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,128 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:32,128 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:18:32,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 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 05:18:32,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:32,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:32,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:18:32,275 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:32,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 05:18:32,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:32,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 05:18:32,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2022-12-06 05:18:32,276 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 05:18:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 523604062, now seen corresponding path program 1 times [2022-12-06 05:18:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:32,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901941161] [2022-12-06 05:18:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:32,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:32,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 05:18:32,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:32,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901941161] [2022-12-06 05:18:32,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901941161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:32,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836501881] [2022-12-06 05:18:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:32,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:32,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 05:18:32,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:32,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:32,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:32,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:32,621 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:18:32,629 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 05:18:32,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:32,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:32,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:32,641 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:32,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:32,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:32,676 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,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 05:18:32,676 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:32,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:32,676 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:32,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:32,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,705 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:32,705 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:18:32,707 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 05:18:32,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:32,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:32,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:32,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:18:32,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:32,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 05:18:32,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:32,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 05:18:32,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2022-12-06 05:18:32,860 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 05:18:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2028552899, now seen corresponding path program 1 times [2022-12-06 05:18:32,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:32,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090930372] [2022-12-06 05:18:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:32,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 05:18:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:32,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090930372] [2022-12-06 05:18:32,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090930372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:32,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:32,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103510046] [2022-12-06 05:18:32,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:32,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:32,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:32,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:32,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:32,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:32,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:32,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:32,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:33,194 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:33,194 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:33,201 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 05:18:33,208 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:33,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:33,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:33,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 05:18:33,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:33,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 05:18:33,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,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 05:18:33,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:33,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:33,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:33,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:33,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,271 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:33,271 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:18:33,272 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 05:18:33,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:33,418 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:33,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:33,419 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:33,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:33,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:33,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:33,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2022-12-06 05:18:33,419 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 05:18:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash -285742564, now seen corresponding path program 1 times [2022-12-06 05:18:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:33,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306892195] [2022-12-06 05:18:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:33,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 05:18:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306892195] [2022-12-06 05:18:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306892195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:33,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:33,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744265091] [2022-12-06 05:18:33,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:33,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:33,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:33,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:33,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:33,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:33,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 05:18:33,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:33,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:33,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:33,760 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:33,760 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:33,766 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 05:18:33,774 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:33,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:33,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:33,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 05:18:33,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:33,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 05:18:33,806 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,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 05:18:33,806 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:33,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:33,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:33,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:33,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,831 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:33,832 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:18:33,833 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 05:18:33,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:33,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:33,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:33,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:18:33,981 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:33,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 05:18:33,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:33,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 05:18:33,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2022-12-06 05:18:33,982 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 05:18:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1457067771, now seen corresponding path program 1 times [2022-12-06 05:18:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:33,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123182526] [2022-12-06 05:18:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:34,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 05:18:34,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:34,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123182526] [2022-12-06 05:18:34,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123182526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:34,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:34,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:34,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551639611] [2022-12-06 05:18:34,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:34,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:34,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:34,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:34,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:34,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 05:18:34,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:34,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:34,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:34,317 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:34,317 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:18:34,323 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 05:18:34,330 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:34,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:34,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:34,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 05:18:34,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:34,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:34,362 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,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 05:18:34,363 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:34,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:34,363 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:34,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:34,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,388 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:34,388 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:18:34,389 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 05:18:34,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:34,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:34,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:18:34,536 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:34,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 05:18:34,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:34,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 05:18:34,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2022-12-06 05:18:34,537 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 05:18:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1095089190, now seen corresponding path program 1 times [2022-12-06 05:18:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065979054] [2022-12-06 05:18:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:34,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 05:18:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065979054] [2022-12-06 05:18:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065979054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:34,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:34,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549603607] [2022-12-06 05:18:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:34,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:34,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:34,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:34,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:34,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:34,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:34,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:34,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:34,862 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:34,862 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:34,869 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 05:18:34,876 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:34,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:34,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:34,877 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:34,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:34,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:34,911 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:34,912 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:34,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:34,912 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:34,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:34,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,937 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:34,937 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:34,938 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 05:18:34,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:34,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:35,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:35,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 05:18:35,167 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:35,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 05:18:35,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:35,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 05:18:35,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2022-12-06 05:18:35,168 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 05:18:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 647721145, now seen corresponding path program 1 times [2022-12-06 05:18:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:35,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968095999] [2022-12-06 05:18:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:35,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968095999] [2022-12-06 05:18:35,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968095999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:35,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:35,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209208801] [2022-12-06 05:18:35,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:35,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:35,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:35,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:35,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:35,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:35,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:35,559 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:35,560 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:18:35,565 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 05:18:35,571 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:35,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:35,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:35,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 05:18:35,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:35,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 05:18:35,597 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:35,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 05:18:35,597 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:35,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:35,598 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:35,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:35,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:35,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:35,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:35,622 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:35,622 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:18:35,623 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 05:18:35,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:35,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:35,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:35,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:18:35,764 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:35,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 05:18:35,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:35,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 05:18:35,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2022-12-06 05:18:35,765 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 05:18:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1904435816, now seen corresponding path program 1 times [2022-12-06 05:18:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:35,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872568771] [2022-12-06 05:18:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:35,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 05:18:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872568771] [2022-12-06 05:18:35,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872568771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:35,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:35,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68455406] [2022-12-06 05:18:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:35,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:35,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:35,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:35,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:35,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:35,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 05:18:35,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:35,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:35,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:36,098 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:36,098 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:36,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:36,116 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:36,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:36,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:36,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 05:18:36,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:36,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 05:18:36,153 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,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 05:18:36,154 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:36,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:36,154 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:36,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:36,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,181 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:36,181 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:18:36,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 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 05:18:36,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:36,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:36,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:18:36,343 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:36,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 05:18:36,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:36,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 05:18:36,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2022-12-06 05:18:36,343 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 05:18:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash -161625481, now seen corresponding path program 1 times [2022-12-06 05:18:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481855459] [2022-12-06 05:18:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:36,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481855459] [2022-12-06 05:18:36,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481855459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:36,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:36,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:36,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410859914] [2022-12-06 05:18:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:36,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:36,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:36,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:36,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:36,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 05:18:36,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:36,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:36,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:36,692 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:36,692 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:36,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:36,707 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:36,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:36,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:36,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 05:18:36,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:36,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 05:18:36,742 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,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 05:18:36,742 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:36,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:36,743 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:36,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:36,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,778 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:36,778 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:36,779 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 05:18:36,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:36,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:36,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:36,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:18:36,942 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:36,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 05:18:36,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:36,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 05:18:36,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2022-12-06 05:18:36,943 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 05:18:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:36,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1581184854, now seen corresponding path program 1 times [2022-12-06 05:18:36,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:36,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748009098] [2022-12-06 05:18:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:36,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:37,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748009098] [2022-12-06 05:18:37,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748009098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:37,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:37,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058866934] [2022-12-06 05:18:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:37,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:37,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:37,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:37,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:37,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:37,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:37,301 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:37,302 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:37,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 05:18:37,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:37,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:37,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:37,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 05:18:37,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:37,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:37,349 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:37,350 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:37,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:37,350 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:37,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:37,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,375 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:37,375 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:37,376 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 05:18:37,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:37,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:37,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:37,528 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:37,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 05:18:37,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:37,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 05:18:37,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2022-12-06 05:18:37,528 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 05:18:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -970972107, now seen corresponding path program 1 times [2022-12-06 05:18:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:37,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746360908] [2022-12-06 05:18:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:37,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:37,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 05:18:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:37,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746360908] [2022-12-06 05:18:37,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746360908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:37,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:37,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:37,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625291375] [2022-12-06 05:18:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:37,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:37,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:37,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:37,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:37,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:37,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 05:18:37,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:37,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:37,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:37,881 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:37,881 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:37,887 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 05:18:37,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:37,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:37,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:37,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 05:18:37,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:37,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 05:18:37,945 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,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 05:18:37,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:37,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:37,946 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:37,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:37,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,981 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:37,982 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:37,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 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 05:18:37,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:37,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:38,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:38,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:18:38,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:38,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 05:18:38,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:38,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 05:18:38,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2022-12-06 05:18:38,161 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 05:18:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash 771838228, now seen corresponding path program 1 times [2022-12-06 05:18:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:38,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131390565] [2022-12-06 05:18:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:38,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 05:18:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131390565] [2022-12-06 05:18:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131390565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:38,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661993078] [2022-12-06 05:18:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:38,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:38,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:38,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:38,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 05:18:38,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:38,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:38,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:38,508 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:38,509 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:38,515 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 05:18:38,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:38,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:38,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:38,524 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:38,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:38,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:38,558 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:38,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 05:18:38,558 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:38,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:38,558 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:38,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:38,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:38,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:38,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:38,583 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:38,583 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:18:38,584 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 05:18:38,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:38,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:38,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:38,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:18:38,752 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:38,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:38,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:38,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:38,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2022-12-06 05:18:38,752 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 05:18:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1780318733, now seen corresponding path program 1 times [2022-12-06 05:18:38,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:38,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822272429] [2022-12-06 05:18:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:38,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 05:18:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822272429] [2022-12-06 05:18:38,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822272429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:38,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:38,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635293079] [2022-12-06 05:18:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:38,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:38,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:38,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:38,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:38,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 05:18:38,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:38,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:39,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:39,070 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:18:39,076 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 05:18:39,083 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:39,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:39,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:39,084 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:39,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:39,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 05:18:39,116 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:39,116 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:39,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:39,116 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:39,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:39,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,141 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:39,142 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:39,143 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 05:18:39,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:39,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:39,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:18:39,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:39,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 05:18:39,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:39,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 05:18:39,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2022-12-06 05:18:39,292 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 05:18:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -37508398, now seen corresponding path program 1 times [2022-12-06 05:18:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:39,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545912443] [2022-12-06 05:18:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:39,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 05:18:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:39,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545912443] [2022-12-06 05:18:39,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545912443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:39,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:39,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759606766] [2022-12-06 05:18:39,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:39,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:39,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 05:18:39,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:39,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:39,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:39,654 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:39,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:39,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 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 05:18:39,668 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:39,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:39,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:39,669 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:39,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:39,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 05:18:39,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,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 05:18:39,700 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:39,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:39,700 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:39,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:39,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,728 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:39,728 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:18:39,729 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 05:18:39,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:39,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:39,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:39,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:39,886 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:39,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 05:18:39,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:39,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 05:18:39,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2022-12-06 05:18:39,887 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 05:18:39,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1705301937, now seen corresponding path program 1 times [2022-12-06 05:18:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:39,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330375348] [2022-12-06 05:18:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:39,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 05:18:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:39,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330375348] [2022-12-06 05:18:39,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330375348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:39,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:39,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195476494] [2022-12-06 05:18:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:39,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:39,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:39,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 05:18:39,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:39,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:40,208 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:40,208 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:40,215 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 05:18:40,222 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:40,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:40,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:40,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 05:18:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:40,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 05:18:40,255 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:40,255 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:40,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:40,255 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:40,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:40,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,283 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:40,283 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:40,284 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 05:18:40,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:40,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:40,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:40,441 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:40,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 05:18:40,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:40,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 05:18:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2022-12-06 05:18:40,442 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 05:18:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash -846855024, now seen corresponding path program 1 times [2022-12-06 05:18:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:40,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653362678] [2022-12-06 05:18:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:40,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 05:18:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:40,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653362678] [2022-12-06 05:18:40,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653362678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:40,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:40,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271602024] [2022-12-06 05:18:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:40,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:40,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:40,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 05:18:40,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:40,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:40,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:40,801 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:40,801 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:18:40,807 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 05:18:40,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:40,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:40,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:40,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 05:18:40,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:40,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 05:18:40,840 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,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 05:18:40,841 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:40,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:40,841 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:40,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:40,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,866 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:40,866 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:18:40,867 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 05:18:40,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:40,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:41,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:41,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:18:41,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:41,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 05:18:41,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:41,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 05:18:41,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2022-12-06 05:18:41,028 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 05:18:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:41,028 INFO L85 PathProgramCache]: Analyzing trace with hash 895955311, now seen corresponding path program 1 times [2022-12-06 05:18:41,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:41,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873911982] [2022-12-06 05:18:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:41,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 05:18:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:41,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873911982] [2022-12-06 05:18:41,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873911982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:41,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:41,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:41,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737346062] [2022-12-06 05:18:41,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:41,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:41,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:41,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:41,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 05:18:41,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:41,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:41,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:41,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:41,354 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:41,361 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 05:18:41,369 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:41,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:41,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:41,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 05:18:41,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:41,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:41,402 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:41,402 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:41,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:41,402 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:41,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:41,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,427 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:41,428 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:18:41,429 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 05:18:41,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:41,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:41,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:41,588 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:41,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:41,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:41,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:41,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2022-12-06 05:18:41,589 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 05:18:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1656201650, now seen corresponding path program 1 times [2022-12-06 05:18:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:41,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974587837] [2022-12-06 05:18:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:41,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:41,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974587837] [2022-12-06 05:18:41,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974587837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:41,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:41,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544925604] [2022-12-06 05:18:41,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:41,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:41,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:41,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:41,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:41,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:41,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:41,928 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:41,928 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:41,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:41,943 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:41,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:41,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:41,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 05:18:41,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:41,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:41,975 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:41,975 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:41,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:41,975 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:41,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:41,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:41,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,009 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:42,009 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:42,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 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 05:18:42,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:42,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:42,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:18:42,169 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:42,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 05:18:42,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:42,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 05:18:42,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2022-12-06 05:18:42,170 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 05:18:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 86608685, now seen corresponding path program 1 times [2022-12-06 05:18:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:42,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113962790] [2022-12-06 05:18:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113962790] [2022-12-06 05:18:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113962790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822494636] [2022-12-06 05:18:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:42,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:42,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:42,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 05:18:42,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:42,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:42,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:42,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:42,502 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:42,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 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 05:18:42,515 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:42,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:42,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:42,516 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:42,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:42,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 05:18:42,547 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,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 05:18:42,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:42,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:42,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:42,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:42,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,572 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:42,572 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:18:42,573 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 05:18:42,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:42,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:42,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:42,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:18:42,715 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:42,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 05:18:42,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:42,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 05:18:42,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2022-12-06 05:18:42,715 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 05:18:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1829419020, now seen corresponding path program 1 times [2022-12-06 05:18:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500839434] [2022-12-06 05:18:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:42,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 05:18:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500839434] [2022-12-06 05:18:42,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500839434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:42,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:42,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285319144] [2022-12-06 05:18:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:42,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:42,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:42,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 05:18:42,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:42,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:42,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:43,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:43,049 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:43,055 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 05:18:43,062 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:43,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:43,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:43,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 05:18:43,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:43,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 05:18:43,095 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,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 05:18:43,096 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:43,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:43,096 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:43,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:43,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,120 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:43,121 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:18:43,122 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 05:18:43,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:43,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:43,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:18:43,270 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:43,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 05:18:43,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:43,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 05:18:43,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2022-12-06 05:18:43,270 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 05:18:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash -722737941, now seen corresponding path program 1 times [2022-12-06 05:18:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:43,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095779239] [2022-12-06 05:18:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:43,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095779239] [2022-12-06 05:18:43,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095779239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:43,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:43,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508457076] [2022-12-06 05:18:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:43,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:43,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:43,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:43,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:43,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:43,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:43,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:43,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:43,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:43,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:43,599 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:18:43,606 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 05:18:43,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:43,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:43,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:43,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 05:18:43,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:43,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 05:18:43,647 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,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 05:18:43,647 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:43,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:43,648 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:43,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:43,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,673 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:43,673 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:43,674 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 05:18:43,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:43,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:43,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:43,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:18:43,820 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:43,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 05:18:43,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:43,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 05:18:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2022-12-06 05:18:43,820 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 05:18:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1020072394, now seen corresponding path program 1 times [2022-12-06 05:18:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:43,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131470256] [2022-12-06 05:18:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:43,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131470256] [2022-12-06 05:18:43,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131470256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:43,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:43,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947318060] [2022-12-06 05:18:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:43,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:43,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:43,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:43,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 05:18:43,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:43,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:43,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:44,140 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:44,140 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:44,147 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 05:18:44,154 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:44,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:44,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:44,155 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:44,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:44,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:44,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:44,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:44,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:44,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:44,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:44,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,212 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:44,212 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:18:44,213 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 05:18:44,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:44,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:44,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:18:44,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:44,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 05:18:44,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18: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 05:18:44,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2022-12-06 05:18:44,368 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 05:18:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1532084567, now seen corresponding path program 1 times [2022-12-06 05:18:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:44,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569220617] [2022-12-06 05:18:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:44,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 05:18:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569220617] [2022-12-06 05:18:44,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569220617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:44,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:44,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151660104] [2022-12-06 05:18:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:44,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:44,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:44,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:44,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:44,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:44,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 05:18:44,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:44,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:44,712 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:44,712 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:44,718 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 05:18:44,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:44,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:44,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18: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 05:18:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:44,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 05:18:44,757 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,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 05:18:44,757 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:44,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:44,757 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:44,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:44,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,786 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:44,786 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:44,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 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 05:18:44,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:44,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:44,945 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:44,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:18:44,945 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:44,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 05:18:44,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:44,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 05:18:44,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2022-12-06 05:18:44,946 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 05:18:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 210725768, now seen corresponding path program 1 times [2022-12-06 05:18:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:44,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281316705] [2022-12-06 05:18:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:45,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 05:18:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:45,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281316705] [2022-12-06 05:18:45,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281316705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:45,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:45,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596318092] [2022-12-06 05:18:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:45,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:45,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:45,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 05:18:45,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:45,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:45,306 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:45,306 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:45,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:45,324 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:45,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:45,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:45,325 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:45,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:45,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:45,357 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:45,358 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:45,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:45,358 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:45,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:45,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,384 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:45,384 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:18:45,385 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 05:18:45,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:45,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:45,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:18:45,547 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:45,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:45,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:45,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:45,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2022-12-06 05:18:45,547 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 05:18:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1953536103, now seen corresponding path program 1 times [2022-12-06 05:18:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:45,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078384774] [2022-12-06 05:18:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:45,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078384774] [2022-12-06 05:18:45,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078384774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:45,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:45,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436947560] [2022-12-06 05:18:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:45,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:45,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:45,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:45,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:45,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:45,904 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:45,904 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:45,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:45,915 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:45,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:45,916 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:45,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 05:18:45,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:45,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:45,947 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:45,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:45,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:45,948 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:45,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:45,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,973 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:45,973 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:18:45,974 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 05:18:45,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:45,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:46,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:46,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:18:46,131 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:46,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 05:18:46,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:46,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 05:18:46,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2022-12-06 05:18:46,131 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 05:18:46,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash -598620858, now seen corresponding path program 1 times [2022-12-06 05:18:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:46,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577320083] [2022-12-06 05:18:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:46,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 05:18:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:46,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577320083] [2022-12-06 05:18:46,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577320083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:46,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:46,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:46,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499947555] [2022-12-06 05:18:46,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:46,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:46,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:46,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 05:18:46,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:46,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:46,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:46,451 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:46,451 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:46,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 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 05:18:46,465 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:46,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:46,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:46,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 05:18:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:46,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:46,513 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:46,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:46,513 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:46,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:46,513 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:46,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:46,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:46,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:46,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:46,548 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:46,549 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:46,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 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 05:18:46,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:46,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:46,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:46,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 05:18:46,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:46,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 05:18:46,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:46,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 05:18:46,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2022-12-06 05:18:46,736 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 05:18:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1144189477, now seen corresponding path program 1 times [2022-12-06 05:18:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:46,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713907374] [2022-12-06 05:18:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:46,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 05:18:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713907374] [2022-12-06 05:18:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713907374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:46,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:46,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:46,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959996544] [2022-12-06 05:18:46,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:46,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:46,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:46,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:46,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:46,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:46,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 05:18:46,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:46,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:46,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:47,071 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:47,071 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:18:47,078 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 05:18:47,085 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:47,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:47,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:47,086 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:47,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:47,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:47,118 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:47,118 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:47,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:47,118 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:47,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:47,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,143 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:47,144 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:18:47,145 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 05:18:47,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:47,302 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:47,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:18:47,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:47,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:47,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:47,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:47,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2022-12-06 05:18:47,303 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 05:18:47,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:47,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1407967484, now seen corresponding path program 1 times [2022-12-06 05:18:47,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:47,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652759640] [2022-12-06 05:18:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:47,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:47,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 05:18:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:47,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652759640] [2022-12-06 05:18:47,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652759640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:47,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:47,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551399312] [2022-12-06 05:18:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:47,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:47,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:47,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:47,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:47,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:47,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 05:18:47,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:47,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:47,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:47,639 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:47,639 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:47,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:47,653 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:47,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:47,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:47,654 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:47,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:47,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 05:18:47,685 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:47,685 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:47,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:47,685 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:47,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:47,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,710 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:47,710 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:18:47,711 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 05:18:47,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:47,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:47,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:47,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:18:47,881 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:47,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 05:18:47,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:47,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 05:18:47,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2022-12-06 05:18:47,881 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 05:18:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 334842851, now seen corresponding path program 1 times [2022-12-06 05:18:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:47,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132154626] [2022-12-06 05:18:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:47,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 05:18:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132154626] [2022-12-06 05:18:47,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132154626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:47,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:47,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818344550] [2022-12-06 05:18:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:47,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:47,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:47,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:47,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:47,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:48,225 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:48,225 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:48,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:48,240 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:48,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:48,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:48,240 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:48,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:48,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 05:18:48,275 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,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 05:18:48,275 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:48,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:48,275 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:48,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:48,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,300 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:48,300 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:48,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 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 05:18:48,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:48,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:48,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:18:48,456 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:48,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:48,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:48,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 05:18:48,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2022-12-06 05:18:48,457 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 05:18:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:48,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653186, now seen corresponding path program 1 times [2022-12-06 05:18:48,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:48,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307728716] [2022-12-06 05:18:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:48,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 05:18:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:48,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307728716] [2022-12-06 05:18:48,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307728716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:48,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:48,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:48,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282812378] [2022-12-06 05:18:48,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:48,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:48,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:48,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 05:18:48,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:48,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:48,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:48,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:48,832 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:48,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:48,847 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:48,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:48,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:48,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 05:18:48,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:48,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 05:18:48,885 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,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 05:18:48,886 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:48,886 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:48,886 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,887 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:48,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:48,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,914 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:48,914 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:18:48,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 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 05:18:48,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:48,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:49,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:49,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 05:18:49,093 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:49,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 05:18:49,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:49,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 05:18:49,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2022-12-06 05:18:49,093 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 05:18:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash -474503775, now seen corresponding path program 1 times [2022-12-06 05:18:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:49,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93828051] [2022-12-06 05:18:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:49,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 05:18:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:49,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93828051] [2022-12-06 05:18:49,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93828051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:49,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:49,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379254941] [2022-12-06 05:18:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:49,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:49,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:49,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 05:18:49,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:49,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:49,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:49,431 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:49,431 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:49,437 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 05:18:49,444 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:49,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:49,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:49,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 05:18:49,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:49,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:49,479 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:49,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:49,480 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:49,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:49,480 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:49,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:49,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:49,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:49,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:49,516 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:49,516 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:49,518 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 05:18:49,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:49,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:49,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:49,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 05:18:49,691 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:49,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:49,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:49,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:49,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2022-12-06 05:18:49,691 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 05:18:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1268306560, now seen corresponding path program 1 times [2022-12-06 05:18:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:49,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001984570] [2022-12-06 05:18:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:49,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 05:18:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:49,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001984570] [2022-12-06 05:18:49,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001984570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:49,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:49,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898614080] [2022-12-06 05:18:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:49,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:49,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:49,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:49,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:49,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:49,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:50,075 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:50,075 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:50,081 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 05:18:50,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:50,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:50,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:50,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 05:18:50,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:50,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 05:18:50,116 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:50,116 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:50,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:50,117 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:50,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:50,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,141 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:50,141 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:18:50,142 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 05:18:50,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:50,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:50,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:18:50,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:50,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 05:18:50,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:50,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 05:18:50,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2022-12-06 05:18:50,297 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 05:18:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1283850401, now seen corresponding path program 1 times [2022-12-06 05:18:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:50,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974925830] [2022-12-06 05:18:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:50,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 05:18:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:50,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974925830] [2022-12-06 05:18:50,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974925830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:50,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:50,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116182934] [2022-12-06 05:18:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:50,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:50,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:50,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:50,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 05:18:50,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:50,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:50,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:50,611 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:50,611 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:50,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 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 05:18:50,625 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:50,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:50,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:50,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 05:18:50,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:50,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 05:18:50,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,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 05:18:50,657 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:50,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:50,657 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:50,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:50,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,682 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:50,682 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:18:50,683 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 05:18:50,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:50,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:50,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:50,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:50,843 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:50,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 05:18:50,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:50,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 05:18:50,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2022-12-06 05:18:50,844 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 05:18:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 458959934, now seen corresponding path program 1 times [2022-12-06 05:18:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:50,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543964121] [2022-12-06 05:18:50,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:50,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543964121] [2022-12-06 05:18:50,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543964121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:50,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:50,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813421137] [2022-12-06 05:18:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:50,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:50,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:50,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 05:18:50,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:50,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:51,182 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:51,182 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:18:51,188 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 05:18:51,195 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:51,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:51,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:51,196 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:51,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:51,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 05:18:51,263 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,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 05:18:51,263 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:51,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:51,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,264 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:51,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:51,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,289 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:51,289 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:18:51,290 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 05:18:51,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:51,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:51,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:18:51,449 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:51,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 05:18:51,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:51,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 05:18:51,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2022-12-06 05:18:51,449 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 05:18:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2093197027, now seen corresponding path program 1 times [2022-12-06 05:18:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:51,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767884326] [2022-12-06 05:18:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:51,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767884326] [2022-12-06 05:18:51,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767884326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:51,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:51,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721657703] [2022-12-06 05:18:51,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:51,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:51,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:51,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:51,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:51,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:51,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:51,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:51,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:51,770 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:51,770 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:18:51,777 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 05:18:51,784 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:51,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:51,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:51,785 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:51,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:51,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:51,816 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:51,816 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:51,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:51,816 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:51,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:51,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,841 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:51,841 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:51,842 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 05:18:51,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:51,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:52,001 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:52,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:18:52,001 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:52,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 05:18:52,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:52,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 05:18:52,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2022-12-06 05:18:52,002 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 05:18:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -350386692, now seen corresponding path program 1 times [2022-12-06 05:18:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:52,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509438562] [2022-12-06 05:18:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:52,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 05:18:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509438562] [2022-12-06 05:18:52,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509438562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:52,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:52,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132506367] [2022-12-06 05:18:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:52,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:52,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 05:18:52,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:52,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:52,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:52,339 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:52,339 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:52,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:52,352 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:52,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:52,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:52,353 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:52,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:52,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 05:18:52,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:52,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:52,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:52,387 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:52,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:52,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,412 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:52,412 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:18:52,413 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 05:18:52,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:52,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:52,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:18:52,560 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:52,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 05:18:52,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:52,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 05:18:52,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2022-12-06 05:18:52,560 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 05:18:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1392423643, now seen corresponding path program 1 times [2022-12-06 05:18:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:52,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426224661] [2022-12-06 05:18:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:52,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 05:18:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:52,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426224661] [2022-12-06 05:18:52,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426224661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:52,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:52,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602619592] [2022-12-06 05:18:52,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:52,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:52,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:52,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:52,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 05:18:52,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:52,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:52,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:52,891 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:52,891 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:52,898 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 05:18:52,905 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:52,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:52,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:52,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 05:18:52,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:52,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:52,938 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,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 05:18:52,938 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:52,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:52,938 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:52,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:52,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,966 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:52,966 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:18:52,967 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 05:18:52,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:52,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:53,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:53,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 05:18:53,151 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:53,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 05:18:53,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:53,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 05:18:53,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2022-12-06 05:18:53,151 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 05:18:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1159733318, now seen corresponding path program 1 times [2022-12-06 05:18:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:53,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879631972] [2022-12-06 05:18:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:53,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 05:18:53,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879631972] [2022-12-06 05:18:53,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879631972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:53,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:53,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266278236] [2022-12-06 05:18:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:53,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:53,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:53,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 05:18:53,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:53,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:53,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:53,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:53,483 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:53,490 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 05:18:53,498 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:53,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:53,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:53,498 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:53,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:53,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:53,530 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:53,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:53,531 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:53,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:53,531 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:53,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:53,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:53,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:53,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:53,556 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:53,556 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:18:53,557 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 05:18:53,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:53,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:53,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:53,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:53,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:53,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 05:18:53,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:53,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 05:18:53,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2022-12-06 05:18:53,709 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 05:18:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash 583077017, now seen corresponding path program 1 times [2022-12-06 05:18:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:53,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087290508] [2022-12-06 05:18:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18: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 05:18:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:53,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087290508] [2022-12-06 05:18:53,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087290508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:53,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:53,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395882802] [2022-12-06 05:18:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:53,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:53,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:53,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:53,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:53,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:53,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:53,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:53,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:54,035 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:54,035 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:18:54,042 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 05:18:54,049 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:54,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:54,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18: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 05:18:54,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:54,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 05:18:54,080 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,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 05:18:54,080 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:54,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:54,081 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:54,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:54,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,106 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:54,106 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:18:54,107 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 05:18:54,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:54,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:54,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:18:54,253 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:54,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:54,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:54,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2022-12-06 05:18:54,253 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 05:18:54,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1969079944, now seen corresponding path program 1 times [2022-12-06 05:18:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:54,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98942111] [2022-12-06 05:18:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98942111] [2022-12-06 05:18:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98942111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:54,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:54,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745288343] [2022-12-06 05:18:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:54,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:54,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:54,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 05:18:54,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:54,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:54,573 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:54,573 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:54,579 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 05:18:54,587 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:54,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:54,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:54,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 05:18:54,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:54,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 05:18:54,619 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,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 05:18:54,620 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:54,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:54,620 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:54,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:54,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,645 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:54,645 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:18:54,646 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 05:18:54,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:54,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:54,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:54,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:18:54,817 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:54,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:54,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:54,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2022-12-06 05:18:54,817 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 05:18:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -226269609, now seen corresponding path program 1 times [2022-12-06 05:18:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:54,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012661936] [2022-12-06 05:18:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:54,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 05:18:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:54,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012661936] [2022-12-06 05:18:54,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012661936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:54,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:54,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996919374] [2022-12-06 05:18:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:54,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:54,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:54,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:54,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 05:18:54,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:54,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:54,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:55,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:55,290 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:55,297 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 05:18:55,303 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:55,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:55,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:55,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 05:18:55,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:55,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:55,335 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,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 05:18:55,335 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:55,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:55,335 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:55,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:55,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,360 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:55,360 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:18:55,361 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 05:18:55,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:55,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:55,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:18:55,527 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:55,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:55,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:55,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2022-12-06 05:18:55,527 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 05:18:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1516540726, now seen corresponding path program 1 times [2022-12-06 05:18:55,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:55,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713155338] [2022-12-06 05:18:55,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:55,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713155338] [2022-12-06 05:18:55,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713155338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:55,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:55,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384652299] [2022-12-06 05:18:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:55,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:55,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:55,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:55,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:55,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:55,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:55,854 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:55,854 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:18:55,860 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 05:18:55,868 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:55,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:55,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:55,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 05:18:55,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:55,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 05:18:55,901 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,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 05:18:55,901 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:55,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:55,901 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:55,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:55,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,927 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:55,927 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:18:55,928 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 05:18:55,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:55,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:56,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:56,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:18:56,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:56,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 05:18:56,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:56,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 05:18:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2022-12-06 05:18:56,086 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 05:18:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1035616235, now seen corresponding path program 1 times [2022-12-06 05:18:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964134860] [2022-12-06 05:18:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:56,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 05:18:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:56,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964134860] [2022-12-06 05:18:56,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964134860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:56,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:56,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274484978] [2022-12-06 05:18:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:56,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:56,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:56,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 05:18:56,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:56,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:56,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:56,403 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:56,403 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:56,409 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 05:18:56,416 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:56,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:56,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:56,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 05:18:56,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:56,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:56,450 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:56,451 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:56,451 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:56,451 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:56,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:56,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,482 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:56,482 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:56,483 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 05:18:56,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:56,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:56,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:18:56,625 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:56,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:56,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:56,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:56,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2022-12-06 05:18:56,625 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 05:18:56,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash 707194100, now seen corresponding path program 1 times [2022-12-06 05:18:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:56,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167636077] [2022-12-06 05:18:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:56,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 05:18:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:56,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167636077] [2022-12-06 05:18:56,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167636077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:56,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:56,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144091693] [2022-12-06 05:18:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:56,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:56,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:56,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:56,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:56,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 05:18:56,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:56,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:56,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:56,947 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:56,947 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:56,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:56,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:56,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:56,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:56,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 05:18:56,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:56,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:56,993 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:56,993 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:56,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:56,993 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:56,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:56,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,018 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:57,018 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:18:57,020 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 05:18:57,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:57,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:57,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:18:57,178 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:57,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 05:18:57,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:57,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 05:18:57,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2022-12-06 05:18:57,178 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 05:18:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1844962861, now seen corresponding path program 1 times [2022-12-06 05:18:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731858381] [2022-12-06 05:18:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:57,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 05:18:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:57,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731858381] [2022-12-06 05:18:57,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731858381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:57,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:57,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648896709] [2022-12-06 05:18:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:57,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:57,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:57,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 05:18:57,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:57,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:57,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:57,507 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:57,507 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:57,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:18:57,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:57,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:57,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:57,524 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:57,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:57,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 05:18:57,557 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,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 05:18:57,557 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:57,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:57,557 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:57,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:57,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,582 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:57,582 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:18:57,583 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 05:18:57,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:57,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:57,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:57,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:18:57,746 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:57,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:57,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:57,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:57,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2022-12-06 05:18:57,746 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 05:18:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash -102152526, now seen corresponding path program 1 times [2022-12-06 05:18:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:57,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354908138] [2022-12-06 05:18:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:57,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 05:18:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354908138] [2022-12-06 05:18:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354908138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:57,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641735578] [2022-12-06 05:18:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:57,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:57,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:57,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 05:18:57,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:57,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:58,076 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:58,076 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:18:58,084 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 05:18:58,093 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:58,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:58,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:58,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 05:18:58,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:58,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 05:18:58,128 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,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 05:18:58,128 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:58,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:58,128 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:58,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:58,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,154 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:58,155 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:18:58,156 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 05:18:58,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:58,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:58,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:18:58,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:58,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 05:18:58,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:58,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 05:18:58,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2022-12-06 05:18:58,321 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 05:18:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1640657809, now seen corresponding path program 1 times [2022-12-06 05:18:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:58,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971966440] [2022-12-06 05:18:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:58,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971966440] [2022-12-06 05:18:58,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971966440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:58,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:58,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955673743] [2022-12-06 05:18:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:58,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:58,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:58,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 05:18:58,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:58,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:58,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:58,672 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:58,672 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:18:58,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 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 05:18:58,686 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:58,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:58,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:58,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 05:18:58,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:58,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 05:18:58,720 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:58,721 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:58,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:58,721 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:58,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:58,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,746 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:18:58,746 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:18:58,747 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 05:18:58,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:58,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:58,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:58,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:18:58,916 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:58,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:58,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:58,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 05:18:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2022-12-06 05:18:58,917 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 05:18:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash -911499152, now seen corresponding path program 1 times [2022-12-06 05:18:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:58,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185175133] [2022-12-06 05:18:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:58,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 05:18:58,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:58,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185175133] [2022-12-06 05:18:58,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185175133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:58,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:58,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410069842] [2022-12-06 05:18:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:58,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:58,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:58,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:58,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:58,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:58,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:58,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:58,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:59,340 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:59,340 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:18:59,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:18:59,353 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:59,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:59,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:59,353 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:18:59,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:59,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 05:18:59,383 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,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 05:18:59,383 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:59,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:59,383 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:59,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:59,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,408 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:18:59,408 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:18:59,409 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 05:18:59,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:18:59,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:59,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:18:59,561 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:18:59,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:59,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:59,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:59,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2022-12-06 05:18:59,561 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 05:18:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash 831311183, now seen corresponding path program 1 times [2022-12-06 05:18:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:59,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909715061] [2022-12-06 05:18:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:59,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 05:18:59,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:59,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909715061] [2022-12-06 05:18:59,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909715061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:59,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:59,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908603120] [2022-12-06 05:18:59,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:59,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:18:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:59,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:18:59,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:18:59,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:18:59,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 05:18:59,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:59,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:18:59,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:59,903 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:18:59,903 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:18:59,913 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 05:18:59,922 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:18:59,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:18:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:18:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:18:59,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:18:59,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 05:18:59,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:18: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 05:18:59,974 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:18:59,974 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:18:59,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:59,974 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:59,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:59,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:18:59,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,006 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:00,006 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:19:00,008 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 05:19:00,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:00,165 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:00,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:19:00,166 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:00,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 05:19:00,166 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:00,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 05:19:00,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2022-12-06 05:19:00,166 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 05:19:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1720845778, now seen corresponding path program 1 times [2022-12-06 05:19:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:00,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043284860] [2022-12-06 05:19:00,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:00,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:00,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 05:19:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:00,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043284860] [2022-12-06 05:19:00,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043284860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:00,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:00,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996073094] [2022-12-06 05:19:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:00,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:00,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:00,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 05:19:00,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:00,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:00,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:00,550 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:00,550 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:00,556 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 05:19:00,563 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:00,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:00,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:00,566 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:00,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:00,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 05:19:00,598 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:00,598 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:00,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:00,598 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:00,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:00,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,626 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:00,627 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:00,628 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 05:19:00,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:00,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:00,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:00,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:19:00,794 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:00,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:00,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:00,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 05:19:00,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2022-12-06 05:19:00,794 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 05:19:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 21964557, now seen corresponding path program 1 times [2022-12-06 05:19:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893816285] [2022-12-06 05:19:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:00,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 05:19:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:00,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893816285] [2022-12-06 05:19:00,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893816285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:00,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:00,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002906763] [2022-12-06 05:19:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:00,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:00,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:00,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:00,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:00,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 05:19:00,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:00,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:00,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:01,145 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:01,145 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:01,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 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 05:19:01,159 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:01,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:01,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:01,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 05:19:01,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:01,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 05:19:01,194 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,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 05:19:01,195 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:01,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:01,195 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:01,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:01,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,223 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:01,223 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:19:01,224 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 05:19:01,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:01,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:01,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:19:01,392 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:01,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:01,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:01,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:01,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2022-12-06 05:19:01,393 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 05:19:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1764774892, now seen corresponding path program 1 times [2022-12-06 05:19:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:01,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968944120] [2022-12-06 05:19:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968944120] [2022-12-06 05:19:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968944120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:01,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:01,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491703724] [2022-12-06 05:19:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:01,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:01,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:01,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:01,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:01,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:01,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 05:19:01,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:01,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:01,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:01,743 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:01,743 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:19:01,750 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 05:19:01,757 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:01,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:01,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:01,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 05:19:01,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:01,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 05:19:01,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,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 05:19:01,792 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:01,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:01,792 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:01,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:01,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,826 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:01,826 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 05:19:01,827 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 05:19:01,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:01,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:01,982 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:01,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:19:01,983 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:01,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:01,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:01,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 05:19:01,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2022-12-06 05:19:01,983 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 05:19:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash -787382069, now seen corresponding path program 1 times [2022-12-06 05:19:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:01,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078500295] [2022-12-06 05:19:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:02,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078500295] [2022-12-06 05:19:02,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078500295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:02,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:02,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280930268] [2022-12-06 05:19:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:02,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:02,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:02,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:02,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:02,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:02,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:02,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:02,321 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:02,321 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:02,329 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 05:19:02,336 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:02,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:02,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:02,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 05:19:02,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19: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 05:19:02,369 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19: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 05:19:02,369 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:02,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:02,369 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:02,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:02,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:02,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:02,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:02,406 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:02,407 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:19:02,408 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 05:19:02,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:02,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:02,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:02,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 05:19:02,588 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:02,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 05:19:02,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:02,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 05:19:02,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2022-12-06 05:19:02,588 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 05:19:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 955428266, now seen corresponding path program 1 times [2022-12-06 05:19:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:02,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149237596] [2022-12-06 05:19:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:02,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:02,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 05:19:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:02,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149237596] [2022-12-06 05:19:02,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149237596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:02,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:02,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885298082] [2022-12-06 05:19:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:02,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:02,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:02,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 05:19:02,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:02,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:02,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:03,046 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:03,046 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:03,054 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 05:19:03,061 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:03,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:03,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:03,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 05:19:03,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:03,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 05:19:03,096 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,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 05:19:03,096 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:03,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:03,096 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:03,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:03,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,122 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:03,122 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:03,123 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 05:19:03,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:03,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:03,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:19:03,283 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:03,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 05:19:03,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:03,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 05:19:03,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2022-12-06 05:19:03,283 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 05:19:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1596728695, now seen corresponding path program 1 times [2022-12-06 05:19:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:03,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337867724] [2022-12-06 05:19:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:03,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337867724] [2022-12-06 05:19:03,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337867724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:03,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:03,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985027304] [2022-12-06 05:19:03,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:03,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:03,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:03,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:03,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 05:19:03,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:03,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:03,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:03,625 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:03,625 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:03,632 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 05:19:03,639 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:03,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:03,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:03,640 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:03,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:03,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 05:19:03,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,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 05:19:03,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:03,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:03,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:03,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:03,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,698 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:03,698 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:03,699 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 05:19:03,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:03,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:03,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:03,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:19:03,852 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:03,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 05:19:03,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:03,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 05:19:03,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2022-12-06 05:19:03,852 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 05:19:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash 146081640, now seen corresponding path program 1 times [2022-12-06 05:19:03,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:03,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161658274] [2022-12-06 05:19:03,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:03,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 05:19:03,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:03,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161658274] [2022-12-06 05:19:03,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161658274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:03,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:03,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353168484] [2022-12-06 05:19:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:03,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:03,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:03,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 05:19:03,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:03,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:04,189 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:04,189 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:04,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 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 05:19:04,203 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:04,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:04,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:04,204 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:04,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:04,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 05:19:04,239 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,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 05:19:04,239 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:04,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:04,239 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:04,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:04,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,264 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:04,265 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:04,266 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 05:19:04,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:04,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:04,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:19:04,412 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:04,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 05:19:04,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:04,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 05:19:04,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2022-12-06 05:19:04,412 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 05:19:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1888891975, now seen corresponding path program 1 times [2022-12-06 05:19:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:04,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046867480] [2022-12-06 05:19:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:04,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:04,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 05:19:04,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046867480] [2022-12-06 05:19:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046867480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:04,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523293851] [2022-12-06 05:19:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:04,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:04,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:04,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 05:19:04,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:04,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:04,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:04,758 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:04,758 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:04,764 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 05:19:04,770 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:04,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:04,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:04,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 05:19:04,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:04,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 05:19:04,800 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,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 05:19:04,801 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:04,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:04,801 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:04,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:04,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,826 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:04,826 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:19:04,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 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 05:19:04,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:04,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:04,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:04,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:19:04,990 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:04,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 05:19:04,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:04,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 05:19:04,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2022-12-06 05:19:04,990 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 05:19:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -663264986, now seen corresponding path program 1 times [2022-12-06 05:19:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:04,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116536047] [2022-12-06 05:19:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:05,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116536047] [2022-12-06 05:19:05,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116536047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:05,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:05,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:05,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790899366] [2022-12-06 05:19:05,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:05,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:05,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:05,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:05,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:05,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 05:19:05,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:05,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:05,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:05,314 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:05,314 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:19:05,321 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 05:19:05,328 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:05,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:05,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:05,330 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:05,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:05,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:05,363 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:05,363 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:05,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:05,363 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:05,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:05,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,388 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:05,388 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:19:05,389 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 05:19:05,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:05,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:05,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:19:05,538 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:05,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:05,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:05,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:05,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2022-12-06 05:19:05,538 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 05:19:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1079545349, now seen corresponding path program 1 times [2022-12-06 05:19:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:05,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591091789] [2022-12-06 05:19:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:05,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 05:19:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:05,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591091789] [2022-12-06 05:19:05,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591091789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:05,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:05,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:05,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286257781] [2022-12-06 05:19:05,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:05,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:05,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:05,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:05,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:05,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:05,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:05,900 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:05,901 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:05,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 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 05:19:05,912 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:05,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:05,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:05,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 05:19:05,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:05,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 05:19:05,947 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:05,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:05,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:05,948 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:05,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:05,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,981 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:05,981 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:05,983 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 05:19:05,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:05,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:06,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:06,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:19:06,142 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:06,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 05:19:06,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:06,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 05:19:06,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2022-12-06 05:19:06,143 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 05:19:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1472611612, now seen corresponding path program 1 times [2022-12-06 05:19:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:06,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18058582] [2022-12-06 05:19:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:06,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18058582] [2022-12-06 05:19:06,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18058582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:06,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:06,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:06,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821307954] [2022-12-06 05:19:06,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:06,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:06,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:06,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:06,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:06,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:06,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:06,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:06,475 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:06,475 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:06,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 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 05:19:06,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:06,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:06,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:06,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 05:19:06,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:06,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 05:19:06,524 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:06,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 05:19:06,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:06,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:06,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:06,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:06,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:06,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:06,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:06,549 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:06,549 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:19:06,550 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 05:19:06,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:06,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:06,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:06,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:19:06,691 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:06,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:06,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:06,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:06,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2022-12-06 05:19:06,691 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 05:19:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 270198723, now seen corresponding path program 1 times [2022-12-06 05:19:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:06,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876368892] [2022-12-06 05:19:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:06,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 05:19:06,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:06,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876368892] [2022-12-06 05:19:06,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876368892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:06,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:06,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7384235] [2022-12-06 05:19:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:06,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:06,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:06,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:06,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:06,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 05:19:06,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:06,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:06,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:07,071 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:07,072 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:07,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 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 05:19:07,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:07,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:07,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:07,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 05:19:07,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:07,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 05:19:07,120 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,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 05:19:07,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:07,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:07,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:07,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:07,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,149 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:07,149 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:07,150 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 05:19:07,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:07,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:07,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:19:07,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:07,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 05:19:07,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:07,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 05:19:07,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2022-12-06 05:19:07,309 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 05:19:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2013009058, now seen corresponding path program 1 times [2022-12-06 05:19:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:07,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674649896] [2022-12-06 05:19:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:07,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 05:19:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674649896] [2022-12-06 05:19:07,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674649896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:07,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:07,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383203321] [2022-12-06 05:19:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:07,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:07,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:07,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:07,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:07,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 05:19:07,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:07,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:07,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:07,669 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:07,669 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:07,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 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 05:19:07,685 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:07,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:07,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:07,686 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:07,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:07,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 05:19:07,721 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,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 05:19:07,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:07,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:07,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:07,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:07,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,748 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:07,749 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:07,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 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 05:19:07,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:07,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:07,908 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:07,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:19:07,909 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:07,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 05:19:07,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:07,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 05:19:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2022-12-06 05:19:07,909 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 05:19:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash -539147903, now seen corresponding path program 1 times [2022-12-06 05:19:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:07,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103532564] [2022-12-06 05:19:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103532564] [2022-12-06 05:19:07,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103532564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:07,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:07,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597277029] [2022-12-06 05:19:07,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:07,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:07,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:07,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:07,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:07,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:07,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:07,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:07,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:07,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:08,243 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:08,243 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:08,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:08,258 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:08,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:08,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:08,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 05:19:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:08,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 05:19:08,291 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,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 05:19:08,291 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:08,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:08,291 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:08,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:08,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,327 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:08,328 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:19:08,329 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 05:19:08,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:08,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:08,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:19:08,485 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:08,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 05:19:08,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:08,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 05:19:08,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2022-12-06 05:19:08,485 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 05:19:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1203662432, now seen corresponding path program 1 times [2022-12-06 05:19:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:08,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566676967] [2022-12-06 05:19:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:08,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 05:19:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:08,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566676967] [2022-12-06 05:19:08,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566676967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:08,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:08,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643183758] [2022-12-06 05:19:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:08,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:08,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:08,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 05:19:08,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:08,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:08,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:08,858 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:08,859 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:08,866 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 05:19:08,873 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:08,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:08,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:08,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 05:19:08,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:08,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:08,906 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,906 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:08,906 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:08,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:08,906 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:08,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:08,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,931 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:08,931 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:19:08,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 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 05:19:08,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:08,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:09,111 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:09,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:19:09,111 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:09,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 05:19:09,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:09,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 05:19:09,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2022-12-06 05:19:09,111 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 05:19:09,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1348494529, now seen corresponding path program 1 times [2022-12-06 05:19:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:09,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102674676] [2022-12-06 05:19:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:09,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 05:19:09,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:09,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102674676] [2022-12-06 05:19:09,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102674676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:09,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:09,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138748728] [2022-12-06 05:19:09,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:09,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:09,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:09,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:09,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 05:19:09,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:09,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:09,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:09,438 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:09,438 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:09,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:09,452 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:09,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:09,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:09,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 05:19:09,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:09,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 05:19:09,487 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:09,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 05:19:09,487 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:09,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:09,487 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:09,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:09,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:09,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:09,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:09,512 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:09,513 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:09,514 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 05:19:09,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:09,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:09,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:09,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:19:09,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:09,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 05:19:09,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:09,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 05:19:09,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2022-12-06 05:19:09,666 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 05:19:09,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash 394315806, now seen corresponding path program 1 times [2022-12-06 05:19:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:09,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963685332] [2022-12-06 05:19:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:09,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 05:19:09,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963685332] [2022-12-06 05:19:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963685332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:09,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:09,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663621246] [2022-12-06 05:19:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:09,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:09,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:09,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:09,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:09,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 05:19:09,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:09,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:09,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:10,016 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:10,017 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:10,026 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 05:19:10,033 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:10,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:10,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:10,034 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:10,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:10,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:10,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,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 05:19:10,069 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:10,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:10,069 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:10,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:10,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,097 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:10,097 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:19:10,099 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 05:19:10,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:10,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:10,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:19:10,252 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:10,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 05:19:10,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:10,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 05:19:10,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2022-12-06 05:19:10,252 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 05:19:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2137126141, now seen corresponding path program 1 times [2022-12-06 05:19:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741784939] [2022-12-06 05:19:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:10,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 05:19:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:10,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741784939] [2022-12-06 05:19:10,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741784939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:10,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:10,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572023094] [2022-12-06 05:19:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:10,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:10,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:10,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:10,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 05:19:10,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:10,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:10,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:10,591 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:10,592 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:10,600 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 05:19:10,607 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:10,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:10,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:10,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 05:19:10,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:10,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 05:19:10,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,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 05:19:10,641 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:10,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:10,641 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:10,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:10,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,667 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:10,667 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:10,668 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 05:19:10,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:10,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:10,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:10,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:19:10,819 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:10,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 05:19:10,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:10,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 05:19:10,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2022-12-06 05:19:10,819 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 05:19:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -415030820, now seen corresponding path program 1 times [2022-12-06 05:19:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:10,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979567622] [2022-12-06 05:19:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:10,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:10,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979567622] [2022-12-06 05:19:10,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979567622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:10,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:10,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:10,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433839154] [2022-12-06 05:19:10,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:10,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:10,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:10,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:10,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:10,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:10,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:10,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:10,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:11,184 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:11,185 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:11,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:11,227 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:11,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:11,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:11,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 05:19:11,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:11,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:11,260 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:11,260 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:11,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:11,260 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:11,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:11,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,297 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:11,298 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:11,299 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 05:19:11,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:11,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:11,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 05:19:11,513 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:11,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 05:19:11,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:11,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 05:19:11,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2022-12-06 05:19:11,513 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 05:19:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1327779515, now seen corresponding path program 1 times [2022-12-06 05:19:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:11,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477397287] [2022-12-06 05:19:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:11,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:11,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 05:19:11,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:11,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477397287] [2022-12-06 05:19:11,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477397287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:11,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:11,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463925328] [2022-12-06 05:19:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:11,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:11,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:11,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:11,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:11,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:11,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:11,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:11,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:11,913 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:11,914 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:11,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 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 05:19:11,928 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:11,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:11,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:11,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 05:19:11,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:11,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:11,962 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,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 05:19:11,963 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:11,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:11,963 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:11,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:11,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,991 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:11,991 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:19:11,992 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 05:19:11,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:11,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:12,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:12,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:19:12,148 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:12,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 05:19:12,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:12,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 05:19:12,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2022-12-06 05:19:12,148 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 05:19:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1224377446, now seen corresponding path program 1 times [2022-12-06 05:19:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:12,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970987123] [2022-12-06 05:19:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:12,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:12,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 05:19:12,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:12,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970987123] [2022-12-06 05:19:12,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970987123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:12,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:12,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588189637] [2022-12-06 05:19:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:12,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:12,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:12,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 05:19:12,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:12,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:12,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:12,486 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:12,487 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:12,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 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 05:19:12,502 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:12,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:12,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:12,503 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:12,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:12,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 05:19:12,536 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:12,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 05:19:12,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:12,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:12,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:12,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:12,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:12,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:12,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:12,563 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:12,563 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:12,565 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 05:19:12,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:12,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:12,736 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:12,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:19:12,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:12,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 05:19:12,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:12,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:12,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2022-12-06 05:19:12,737 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 05:19:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash 518432889, now seen corresponding path program 1 times [2022-12-06 05:19:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:12,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311201525] [2022-12-06 05:19:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:12,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:12,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311201525] [2022-12-06 05:19:12,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311201525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:12,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:12,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062745694] [2022-12-06 05:19:12,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:12,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:12,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:12,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:12,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:12,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:12,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:12,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:13,067 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:13,068 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:13,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:13,083 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:13,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:13,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:13,084 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:13,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:13,118 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:13,118 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:13,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:13,119 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:13,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:13,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,143 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:13,143 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:19:13,144 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 05:19:13,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:13,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:13,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:19:13,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:13,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 05:19:13,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:13,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 05:19:13,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2022-12-06 05:19:13,292 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 05:19:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:13,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2033724072, now seen corresponding path program 1 times [2022-12-06 05:19:13,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:13,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311563223] [2022-12-06 05:19:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:13,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:13,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 05:19:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:13,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311563223] [2022-12-06 05:19:13,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311563223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:13,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:13,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37289723] [2022-12-06 05:19:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:13,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:13,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:13,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:13,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 05:19:13,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:13,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:13,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:13,625 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:13,625 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:13,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 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 05:19:13,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:13,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:13,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:13,641 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:13,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:13,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 05:19:13,672 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,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 05:19:13,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:13,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:13,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:13,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:13,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,698 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:13,698 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:13,699 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 05:19:13,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:13,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:13,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:13,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:19:13,851 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:13,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 05:19:13,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:13,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 05:19:13,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2022-12-06 05:19:13,851 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 05:19:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -290913737, now seen corresponding path program 1 times [2022-12-06 05:19:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:13,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475271803] [2022-12-06 05:19:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:13,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 05:19:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:13,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475271803] [2022-12-06 05:19:13,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475271803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:13,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:13,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484568478] [2022-12-06 05:19:13,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:13,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:13,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:13,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 05:19:13,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:13,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:13,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:14,179 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:14,179 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:14,193 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:14,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:14,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:14,194 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:14,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:14,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:14,226 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,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 05:19:14,226 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:14,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:14,226 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:14,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:14,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,251 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:14,251 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:19:14,252 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 05:19:14,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:14,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:14,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:19:14,397 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:14,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:14,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:14,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:14,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2022-12-06 05:19:14,397 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 05:19:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1451896598, now seen corresponding path program 1 times [2022-12-06 05:19:14,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:14,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778513490] [2022-12-06 05:19:14,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:14,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 05:19:14,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:14,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778513490] [2022-12-06 05:19:14,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778513490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:14,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:14,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:14,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203110813] [2022-12-06 05:19:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:14,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:14,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:14,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:14,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 05:19:14,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:14,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:14,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:14,729 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:14,729 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:19:14,736 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 05:19:14,744 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:14,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:14,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:14,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 05:19:14,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:14,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:14,775 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:14,776 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:14,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:14,776 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:14,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:14,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,800 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:14,801 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:19:14,802 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 05:19:14,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:14,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:14,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:14,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:19:14,958 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:14,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 05:19:14,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:14,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 05:19:14,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2022-12-06 05:19:14,959 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 05:19:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1100260363, now seen corresponding path program 1 times [2022-12-06 05:19:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:14,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123830595] [2022-12-06 05:19:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123830595] [2022-12-06 05:19:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123830595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:15,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442623788] [2022-12-06 05:19:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:15,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:15,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 05:19:15,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:15,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:15,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:15,312 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:15,312 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:15,319 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 05:19:15,325 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:15,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:15,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:15,326 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:15,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:15,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 05:19:15,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,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 05:19:15,355 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:15,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:15,355 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:15,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:15,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,380 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:15,380 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:19:15,381 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 05:19:15,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:15,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:15,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:19:15,541 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:15,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 05:19:15,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:15,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 05:19:15,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2022-12-06 05:19:15,541 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 05:19:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 642549972, now seen corresponding path program 1 times [2022-12-06 05:19:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:15,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915642396] [2022-12-06 05:19:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:15,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915642396] [2022-12-06 05:19:15,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915642396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:15,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:15,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072969595] [2022-12-06 05:19:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:15,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:15,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:15,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:15,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:15,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 05:19:15,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:15,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:15,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:15,886 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:15,886 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:15,893 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 05:19:15,901 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:15,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:15,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:15,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 05:19:15,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:15,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 05:19:15,936 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:15,936 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:15,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:15,936 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:15,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:15,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,962 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:15,962 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:19:15,963 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 05:19:15,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:15,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:16,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:16,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:19:16,121 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:16,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 05:19:16,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:16,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 05:19:16,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2022-12-06 05:19:16,121 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 05:19:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1909606989, now seen corresponding path program 1 times [2022-12-06 05:19:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:16,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714706410] [2022-12-06 05:19:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:16,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 05:19:16,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:16,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714706410] [2022-12-06 05:19:16,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714706410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:16,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:16,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419110659] [2022-12-06 05:19:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:16,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:16,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:16,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:16,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:16,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 05:19:16,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:16,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:16,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:16,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:16,468 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:16,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:16,511 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:16,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:16,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:16,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 05:19:16,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:16,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 05:19:16,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:16,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 05:19:16,541 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:16,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:16,541 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:16,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:16,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:16,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:16,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:16,566 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:16,566 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:19:16,567 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 05:19:16,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:16,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:16,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:16,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:19:16,722 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:16,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 05:19:16,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:16,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 05:19:16,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2022-12-06 05:19:16,722 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 05:19:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash -166796654, now seen corresponding path program 1 times [2022-12-06 05:19:16,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:16,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620629524] [2022-12-06 05:19:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:16,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 05:19:16,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:16,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620629524] [2022-12-06 05:19:16,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620629524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:16,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:16,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955333057] [2022-12-06 05:19:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:16,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:16,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:16,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:16,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 05:19:16,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:16,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:16,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:17,096 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:17,097 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:17,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:17,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:17,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:17,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:17,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 05:19:17,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19: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 05:19:17,145 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19: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 05:19:17,146 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:17,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:17,146 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:17,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:17,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,171 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:17,171 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19: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 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 05:19:17,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:17,318 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:17,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:19:17,319 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:17,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 05:19:17,319 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:17,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 05:19:17,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2022-12-06 05:19:17,319 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 05:19:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1576013681, now seen corresponding path program 1 times [2022-12-06 05:19:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727361183] [2022-12-06 05:19:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:17,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 05:19:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:17,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727361183] [2022-12-06 05:19:17,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727361183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:17,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:17,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:17,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458912137] [2022-12-06 05:19:17,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:17,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:17,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:17,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:17,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:17,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:17,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 05:19:17,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:17,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:17,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:17,662 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:17,662 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:17,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:17,677 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:17,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:17,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:17,678 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:17,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:17,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 05:19:17,713 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,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 05:19:17,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:17,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:17,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:17,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:17,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,747 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:17,747 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:17,749 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 05:19:17,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:17,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:17,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:17,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:19:17,907 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:17,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 05:19:17,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:17,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 05:19:17,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2022-12-06 05:19:17,908 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 05:19:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -976143280, now seen corresponding path program 1 times [2022-12-06 05:19:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792217787] [2022-12-06 05:19:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792217787] [2022-12-06 05:19:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792217787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:17,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:17,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631301546] [2022-12-06 05:19:17,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:17,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:17,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:17,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:17,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:17,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:17,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:18,265 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:18,265 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:18,272 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 05:19:18,279 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:18,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:18,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:18,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:18,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:18,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:18,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 05:19:18,310 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,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 05:19:18,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:18,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:18,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:18,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:18,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,335 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:18,336 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:19:18,337 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 05:19:18,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:18,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:18,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:19:18,477 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:18,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 05:19:18,477 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:18,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 05:19:18,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2022-12-06 05:19:18,477 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 05:19:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 766667055, now seen corresponding path program 1 times [2022-12-06 05:19:18,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:18,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004992170] [2022-12-06 05:19:18,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:18,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 05:19:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:18,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004992170] [2022-12-06 05:19:18,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004992170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:18,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:18,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152540672] [2022-12-06 05:19:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:18,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:18,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:18,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 05:19:18,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:18,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:18,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:18,827 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:18,827 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:19:18,835 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 05:19:18,843 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:18,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:18,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:18,844 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:18,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:18,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:18,883 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:18,883 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:18,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:18,883 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:18,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:18,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,909 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:18,909 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:18,910 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 05:19:18,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:18,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:19,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:19,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:19:19,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:19,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 05:19:19,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:19,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 05:19:19,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2022-12-06 05:19:19,063 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 05:19:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1785489906, now seen corresponding path program 1 times [2022-12-06 05:19:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:19,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001730406] [2022-12-06 05:19:19,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:19,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 05:19:19,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:19,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001730406] [2022-12-06 05:19:19,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001730406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:19,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:19,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:19,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99417150] [2022-12-06 05:19:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:19,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:19,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:19,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 05:19:19,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:19,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:19,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:19,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:19,425 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:19,432 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 05:19:19,439 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:19,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:19,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:19,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 05:19:19,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:19,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 05:19:19,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:19,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:19,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:19,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:19,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:19,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:19,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:19,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:19,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:19,503 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:19,503 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:19,504 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 05:19:19,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:19,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:19,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:19,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:19:19,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:19,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 05:19:19,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:19,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 05:19:19,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2022-12-06 05:19:19,660 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 05:19:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -42679571, now seen corresponding path program 1 times [2022-12-06 05:19:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:19,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175948470] [2022-12-06 05:19:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175948470] [2022-12-06 05:19:19,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175948470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:19,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:19,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282139674] [2022-12-06 05:19:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:19,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:19,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:19,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:19,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:19,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:19,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:19,991 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:19,992 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:19,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:20,008 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:20,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:20,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:20,009 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:20,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19: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 05:19:20,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19: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 05:19:20,042 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:20,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:20,042 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:20,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:20,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,067 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:20,068 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:20,069 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 05:19:20,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:20,226 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:20,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:19:20,226 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:20,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 05:19:20,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:20,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 05:19:20,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2022-12-06 05:19:20,227 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 05:19:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1700130764, now seen corresponding path program 1 times [2022-12-06 05:19:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:20,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839909249] [2022-12-06 05:19:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:20,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 05:19:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:20,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839909249] [2022-12-06 05:19:20,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839909249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:20,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:20,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872810906] [2022-12-06 05:19:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:20,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:20,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:20,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 05:19:20,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:20,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:20,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:20,599 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:20,599 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:19:20,605 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 05:19:20,612 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:20,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:20,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:20,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 05:19:20,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:20,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 05:19:20,640 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:20,640 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:20,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:20,641 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:20,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:20,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,665 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:20,665 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:19:20,666 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 05:19:20,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:20,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:20,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:20,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:19:20,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:20,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 05:19:20,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:20,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 05:19:20,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2022-12-06 05:19:20,810 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 05:19:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -852026197, now seen corresponding path program 1 times [2022-12-06 05:19:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831333233] [2022-12-06 05:19:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831333233] [2022-12-06 05:19:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831333233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238873849] [2022-12-06 05:19:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:20,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:20,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:20,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:20,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 05:19:20,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:20,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:21,197 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:21,197 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:21,207 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 05:19:21,216 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:21,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:21,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:21,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 05:19:21,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:21,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:21,250 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:21,250 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:21,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:21,250 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:21,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:21,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,276 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:21,276 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:21,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 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 05:19:21,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:21,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:21,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 05:19:21,412 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:21,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 05:19:21,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:21,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 05:19:21,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2022-12-06 05:19:21,412 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 05:19:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 890784138, now seen corresponding path program 1 times [2022-12-06 05:19:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881924726] [2022-12-06 05:19:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:21,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:21,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 05:19:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881924726] [2022-12-06 05:19:21,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881924726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:21,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:21,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739946359] [2022-12-06 05:19:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:21,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:21,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 05:19:21,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:21,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:21,800 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:21,800 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:21,805 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 05:19:21,811 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:21,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:21,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:21,812 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:21,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:21,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 05:19:21,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,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 05:19:21,843 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:21,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:21,843 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:21,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:21,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,869 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:21,870 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:21,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 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 05:19:21,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:21,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:22,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:22,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:19:22,025 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:22,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 05:19:22,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:22,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 05:19:22,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2022-12-06 05:19:22,026 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 05:19:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1661372823, now seen corresponding path program 1 times [2022-12-06 05:19:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:22,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470400293] [2022-12-06 05:19:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:22,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:22,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470400293] [2022-12-06 05:19:22,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470400293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:22,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:22,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:22,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656719619] [2022-12-06 05:19:22,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:22,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:22,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:22,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:22,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:22,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:22,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:22,374 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:22,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:22,389 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:22,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:22,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:22,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 05:19:22,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:22,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:22,425 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:22,425 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:22,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:22,425 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:22,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:22,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,450 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:22,450 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:22,451 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 05:19:22,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:22,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:22,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:19:22,594 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:22,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:22,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2022-12-06 05:19:22,594 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 05:19:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash 81437512, now seen corresponding path program 1 times [2022-12-06 05:19:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264411772] [2022-12-06 05:19:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:22,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264411772] [2022-12-06 05:19:22,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264411772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:22,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:22,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:22,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885873368] [2022-12-06 05:19:22,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:22,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:22,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:22,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:22,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:22,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:22,928 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:22,928 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:22,935 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 05:19:22,943 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:22,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:22,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:22,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 05:19:22,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:22,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 05:19:22,978 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,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 05:19:22,978 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:22,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:22,978 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:22,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:22,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:22,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,024 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:23,024 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:19:23,025 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 05:19:23,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:23,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:23,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 05:19:23,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:23,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 05:19:23,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:23,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 05:19:23,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2022-12-06 05:19:23,203 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 05:19:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1824247847, now seen corresponding path program 1 times [2022-12-06 05:19:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:23,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046912305] [2022-12-06 05:19:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:23,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:23,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046912305] [2022-12-06 05:19:23,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046912305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:23,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:23,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565873108] [2022-12-06 05:19:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:23,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:23,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:23,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:23,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:23,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:23,586 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:23,586 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:23,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:23,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:23,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:23,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:23,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 05:19:23,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:23,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 05:19:23,636 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,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 05:19:23,637 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:23,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:23,637 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:23,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:23,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,663 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:23,663 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:19:23,664 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 05:19:23,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:23,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:23,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:23,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:19:23,829 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:23,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 05:19:23,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:23,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 05:19:23,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2022-12-06 05:19:23,830 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 05:19:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -727909114, now seen corresponding path program 1 times [2022-12-06 05:19:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:23,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903717430] [2022-12-06 05:19:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903717430] [2022-12-06 05:19:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903717430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:23,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323588697] [2022-12-06 05:19:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:23,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:23,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:23,887 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:23,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:23,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:23,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:23,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:24,170 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:24,170 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:24,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:24,185 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:24,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:24,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:24,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:24,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 05:19:24,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:24,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 05:19:24,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,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 05:19:24,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:24,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:24,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:24,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:24,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,246 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:24,246 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:19:24,248 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 05:19:24,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:24,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:24,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:19:24,393 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:24,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 05:19:24,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:24,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 05:19:24,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2022-12-06 05:19:24,393 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 05:19:24,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1014901221, now seen corresponding path program 1 times [2022-12-06 05:19:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414247040] [2022-12-06 05:19:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:24,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 05:19:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414247040] [2022-12-06 05:19:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414247040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:24,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:24,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856196537] [2022-12-06 05:19:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:24,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:24,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:24,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:24,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 05:19:24,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:24,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:24,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:24,748 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:24,749 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:24,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:24,764 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:24,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:24,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:24,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 05:19:24,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:24,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 05:19:24,799 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,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 05:19:24,799 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:24,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:24,799 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:24,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:24,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,824 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:24,824 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:24,826 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 05:19:24,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:24,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:24,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:24,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:19:24,972 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:24,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 05:19:24,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:24,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 05:19:24,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2022-12-06 05:19:24,973 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 05:19:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1537255740, now seen corresponding path program 1 times [2022-12-06 05:19:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:24,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814281042] [2022-12-06 05:19:24,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:25,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 05:19:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:25,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814281042] [2022-12-06 05:19:25,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814281042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:25,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:25,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007354456] [2022-12-06 05:19:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:25,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:25,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 05:19:25,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:25,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:25,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:25,335 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:25,336 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:25,342 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 05:19:25,350 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:25,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:25,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:25,351 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:25,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:25,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 05:19:25,384 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:25,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 05:19:25,384 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:25,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:25,384 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:25,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:25,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:25,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:25,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:25,410 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:25,410 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:19:25,411 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 05:19:25,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:25,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:25,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:25,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 05:19:25,597 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:25,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 05:19:25,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:25,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 05:19:25,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2022-12-06 05:19:25,598 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 05:19:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:25,598 INFO L85 PathProgramCache]: Analyzing trace with hash 205554595, now seen corresponding path program 1 times [2022-12-06 05:19:25,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684692129] [2022-12-06 05:19:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:25,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:25,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 05:19:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684692129] [2022-12-06 05:19:25,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684692129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:25,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:25,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:25,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568205734] [2022-12-06 05:19:25,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:25,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:25,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:25,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 05:19:25,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:25,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:25,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:25,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:25,957 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:19:25,965 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 05:19:25,973 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:25,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:25,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:25,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 05:19:25,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:26,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 05:19:26,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,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 05:19:26,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:26,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:26,009 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:26,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:26,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,036 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:26,036 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:19:26,037 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 05:19:26,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:26,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:26,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 05:19:26,264 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:26,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 05:19:26,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:26,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 05:19:26,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2022-12-06 05:19:26,264 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 05:19:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1948364930, now seen corresponding path program 1 times [2022-12-06 05:19:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:26,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215686355] [2022-12-06 05:19:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:26,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 05:19:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:26,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215686355] [2022-12-06 05:19:26,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215686355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:26,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:26,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278751143] [2022-12-06 05:19:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:26,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:26,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 05:19:26,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:26,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:26,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:26,618 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:26,618 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:26,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:26,635 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:26,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:26,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:26,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 05:19:26,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:26,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:26,671 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:26,672 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:26,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:26,672 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:26,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:26,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,709 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:26,709 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:19:26,711 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 05:19:26,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:26,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:26,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:26,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 05:19:26,970 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:26,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 05:19:26,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:26,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 05:19:26,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2022-12-06 05:19:26,970 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 05:19:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash -603792031, now seen corresponding path program 1 times [2022-12-06 05:19:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:26,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170776040] [2022-12-06 05:19:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:27,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 05:19:27,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:27,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170776040] [2022-12-06 05:19:27,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170776040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:27,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:27,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441014177] [2022-12-06 05:19:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:27,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:27,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:27,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 05:19:27,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:27,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:27,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:27,378 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:27,379 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:27,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:27,390 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:27,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:27,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:27,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 05:19:27,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:27,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 05:19:27,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:27,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 05:19:27,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:27,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:27,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:27,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:27,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:27,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:27,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:27,445 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:27,445 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:27,446 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 05:19:27,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:27,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:27,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:27,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:19:27,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:27,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 05:19:27,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19: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 05:19:27,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2022-12-06 05:19:27,613 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 05:19:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1139018304, now seen corresponding path program 1 times [2022-12-06 05:19:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043321470] [2022-12-06 05:19:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:27,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 05:19:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:27,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043321470] [2022-12-06 05:19:27,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043321470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:27,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:27,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533451306] [2022-12-06 05:19:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:27,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:27,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:27,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 05:19:27,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:27,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:27,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:27,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:27,972 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:27,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 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 05:19:27,986 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:27,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:27,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:27,987 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:27,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:28,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:28,021 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:28,022 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:28,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:28,022 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:28,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:28,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,047 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:28,048 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:28,049 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 05:19:28,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:28,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:28,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:19:28,193 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:28,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:28,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:28,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:28,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2022-12-06 05:19:28,193 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 05:19:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1413138657, now seen corresponding path program 1 times [2022-12-06 05:19:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:28,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654696556] [2022-12-06 05:19:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19: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 05:19:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:28,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654696556] [2022-12-06 05:19:28,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654696556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:28,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:28,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832077167] [2022-12-06 05:19:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:28,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:28,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19: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 05:19:28,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:28,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:28,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:28,529 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:28,529 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:28,543 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:28,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:28,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:28,544 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:28,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:28,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:28,577 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,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 05:19:28,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:28,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:28,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:28,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:28,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,612 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:28,612 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:19:28,613 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 05:19:28,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:28,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:28,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:28,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:19:28,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:28,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:28,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:28,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 05:19:28,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2022-12-06 05:19:28,778 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 05:19:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 329671678, now seen corresponding path program 1 times [2022-12-06 05:19:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:28,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844060073] [2022-12-06 05:19:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:28,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 05:19:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844060073] [2022-12-06 05:19:28,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844060073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:28,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:28,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130691646] [2022-12-06 05:19:28,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:28,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:28,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:28,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 05:19:28,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:28,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:28,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:29,138 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:29,139 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:29,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:29,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:29,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:29,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:29,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 05:19:29,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:29,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:29,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:29,186 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:29,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:29,186 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:29,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:29,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,212 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:29,213 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:29,214 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 05:19:29,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:29,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:29,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:19:29,358 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:29,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:29,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:29,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:29,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2022-12-06 05:19:29,358 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 05:19:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2072482013, now seen corresponding path program 1 times [2022-12-06 05:19:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:29,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478225394] [2022-12-06 05:19:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:29,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 05:19:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478225394] [2022-12-06 05:19:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478225394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:29,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:29,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610644765] [2022-12-06 05:19:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:29,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:29,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:29,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:29,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:29,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:29,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:29,699 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:29,699 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:29,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:29,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:29,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:29,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:29,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 05:19:29,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:29,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 05:19:29,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,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 05:19:29,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:29,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:29,752 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:29,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:29,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,779 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:29,779 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:29,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 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 05:19:29,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:29,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:29,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:29,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:19:29,921 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:29,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 05:19:29,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:29,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 05:19:29,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2022-12-06 05:19:29,921 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 05:19:29,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash -479674948, now seen corresponding path program 1 times [2022-12-06 05:19:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:29,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732680992] [2022-12-06 05:19:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:29,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 05:19:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:29,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732680992] [2022-12-06 05:19:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732680992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:29,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:29,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629776485] [2022-12-06 05:19:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:29,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:29,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:29,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:29,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 05:19:29,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:29,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:29,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:30,289 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:30,290 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:30,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 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 05:19:30,304 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:30,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:30,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:30,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 05:19:30,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:30,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 05:19:30,337 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,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 05:19:30,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:30,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:30,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:30,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:30,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,363 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:30,363 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:30,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 05:19:30,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:30,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:30,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:19:30,526 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:30,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 05:19:30,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:30,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 05:19:30,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2022-12-06 05:19:30,527 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 05:19:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1263135387, now seen corresponding path program 1 times [2022-12-06 05:19:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:30,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449102399] [2022-12-06 05:19:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:30,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 05:19:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:30,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449102399] [2022-12-06 05:19:30,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449102399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:30,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:30,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524477449] [2022-12-06 05:19:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:30,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:30,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:30,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:30,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:30,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:30,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:30,880 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:30,880 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19: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 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 05:19:30,897 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:30,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:30,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:30,898 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:30,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:30,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:30,935 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,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 05:19:30,935 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:30,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:30,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:30,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:30,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,963 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:30,963 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:19:30,965 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 05:19:30,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:30,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:31,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:31,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:19:31,131 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:31,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 05:19:31,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:31,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 05:19:31,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2022-12-06 05:19:31,132 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 05:19:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1289021574, now seen corresponding path program 1 times [2022-12-06 05:19:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:31,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819717642] [2022-12-06 05:19:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:31,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 05:19:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:31,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819717642] [2022-12-06 05:19:31,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819717642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:31,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:31,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658372976] [2022-12-06 05:19:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:31,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:31,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:31,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:31,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:31,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 05:19:31,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:31,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:31,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:31,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:31,496 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:31,503 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 05:19:31,510 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:31,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:31,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:31,511 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:31,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:31,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 05:19:31,544 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:31,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:31,544 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:31,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:31,544 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:31,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:31,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:31,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:31,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:31,569 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:31,569 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:31,570 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 05:19:31,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:31,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:31,737 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:31,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:19:31,738 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:31,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 05:19:31,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:31,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 05:19:31,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2022-12-06 05:19:31,738 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 05:19:31,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 453788761, now seen corresponding path program 1 times [2022-12-06 05:19:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:31,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603514080] [2022-12-06 05:19:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:31,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603514080] [2022-12-06 05:19:31,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603514080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:31,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:31,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425133531] [2022-12-06 05:19:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:31,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:31,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:31,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:31,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:31,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:32,099 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:32,100 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:32,107 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 05:19:32,115 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:32,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:32,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:32,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 05:19:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:32,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 05:19:32,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,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 05:19:32,148 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:32,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:32,148 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:32,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:32,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,173 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:32,173 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:19:32,174 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 05:19:32,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:32,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:32,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:19:32,327 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:32,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 05:19:32,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:32,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 05:19:32,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2022-12-06 05:19:32,328 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 05:19:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2098368200, now seen corresponding path program 1 times [2022-12-06 05:19:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:32,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129089025] [2022-12-06 05:19:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:32,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 05:19:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129089025] [2022-12-06 05:19:32,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129089025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:32,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:32,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183337563] [2022-12-06 05:19:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:32,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:32,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:32,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 05:19:32,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:32,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:32,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:32,714 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:32,715 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:32,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 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 05:19:32,725 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:32,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:32,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:32,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:32,726 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:32,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:32,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 05:19:32,756 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,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 05:19:32,756 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:32,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:32,757 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:32,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:32,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,792 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:32,792 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:19:32,794 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 05:19:32,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:32,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:32,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:32,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 05:19:32,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:32,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 05:19:32,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:32,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 05:19:32,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2022-12-06 05:19:32,966 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 05:19:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash -355557865, now seen corresponding path program 1 times [2022-12-06 05:19:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:32,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674588963] [2022-12-06 05:19:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:32,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:33,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 05:19:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:33,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674588963] [2022-12-06 05:19:33,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674588963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:33,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:33,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511508602] [2022-12-06 05:19:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:33,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:33,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:33,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:33,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:33,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:33,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:33,362 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:33,362 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:33,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:33,378 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:33,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:33,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:33,379 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:33,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:33,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:33,416 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,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 05:19:33,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:33,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:33,417 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:33,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:33,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,449 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:33,449 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:33,450 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 05:19:33,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:33,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:33,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:19:33,609 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:33,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:33,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2022-12-06 05:19:33,610 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 05:19:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1387252470, now seen corresponding path program 1 times [2022-12-06 05:19:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:33,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315342873] [2022-12-06 05:19:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315342873] [2022-12-06 05:19:33,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315342873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:33,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:33,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054904891] [2022-12-06 05:19:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:33,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:33,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:33,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:33,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:33,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:33,936 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:33,936 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:33,942 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 05:19:33,950 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:33,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:33,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:33,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 05:19:33,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:33,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 05:19:33,985 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,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 05:19:33,985 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:33,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:33,985 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,986 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:33,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:33,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:33,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,019 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:34,019 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:34,020 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 05:19:34,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:34,173 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:34,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:19:34,174 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:34,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:34,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:34,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:34,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2022-12-06 05:19:34,174 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 05:19:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1164904491, now seen corresponding path program 1 times [2022-12-06 05:19:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:34,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908580738] [2022-12-06 05:19:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:34,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 05:19:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908580738] [2022-12-06 05:19:34,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908580738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:34,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:34,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108977719] [2022-12-06 05:19:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:34,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:34,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 05:19:34,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:34,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:34,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:34,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:34,497 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:19:34,503 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 05:19:34,510 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:34,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:34,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:34,511 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:34,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:34,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 05:19:34,542 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,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 05:19:34,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:34,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:34,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:34,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:34,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,567 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:34,567 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:19:34,568 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 05:19:34,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:34,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:34,747 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:34,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:19:34,747 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:34,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 05:19:34,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:34,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 05:19:34,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2022-12-06 05:19:34,748 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 05:19:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 577905844, now seen corresponding path program 1 times [2022-12-06 05:19:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:34,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153993932] [2022-12-06 05:19:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:34,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 05:19:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153993932] [2022-12-06 05:19:34,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153993932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:34,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:34,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18638905] [2022-12-06 05:19:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:34,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:34,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:34,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:34,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:34,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 05:19:34,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:34,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:35,145 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:35,145 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:19:35,152 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 05:19:35,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:35,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:35,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:35,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 05:19:35,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:35,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 05:19:35,199 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,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 05:19:35,199 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:35,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:35,199 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:35,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:35,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,225 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:35,226 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:19:35,227 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 05:19:35,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:35,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:35,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:19:35,394 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:35,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 05:19:35,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:35,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 05:19:35,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2022-12-06 05:19:35,394 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 05:19:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1974251117, now seen corresponding path program 1 times [2022-12-06 05:19:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:35,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467046769] [2022-12-06 05:19:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:35,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 05:19:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:35,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467046769] [2022-12-06 05:19:35,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467046769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:35,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:35,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186657809] [2022-12-06 05:19:35,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:35,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:35,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:35,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:35,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:35,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 05:19:35,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:35,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:35,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:35,759 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:35,759 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:35,768 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 05:19:35,776 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:35,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:35,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:35,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 05:19:35,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:35,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 05:19:35,811 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,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 05:19:35,811 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:35,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:35,811 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:35,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:35,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,837 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:35,837 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:19:35,838 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 05:19:35,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:35,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:36,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:36,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:19:36,010 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:36,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:36,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:36,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:36,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2022-12-06 05:19:36,011 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 05:19:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -231440782, now seen corresponding path program 1 times [2022-12-06 05:19:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:36,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090848726] [2022-12-06 05:19:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:36,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090848726] [2022-12-06 05:19:36,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090848726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:36,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:36,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752395565] [2022-12-06 05:19:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:36,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:36,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:36,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:36,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:36,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:36,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:36,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:36,372 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:36,372 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:36,379 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 05:19:36,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:36,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:36,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:36,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 05:19:36,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:36,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 05:19:36,422 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:36,423 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:36,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:36,423 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:36,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:36,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,448 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:36,448 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:36,449 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 05:19:36,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:36,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:36,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:19:36,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:36,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 05:19:36,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:36,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 05:19:36,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2022-12-06 05:19:36,607 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 05:19:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1511369553, now seen corresponding path program 1 times [2022-12-06 05:19:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:36,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466148747] [2022-12-06 05:19:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:36,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 05:19:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:36,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466148747] [2022-12-06 05:19:36,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466148747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:36,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:36,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423384127] [2022-12-06 05:19:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:36,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:36,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:36,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 05:19:36,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:36,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:36,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:36,949 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:36,949 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:36,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 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 05:19:36,962 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:36,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:36,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:36,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 05:19:36,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:36,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 05:19:36,992 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:36,993 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:36,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:36,993 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:36,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:36,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:36,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,018 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:37,018 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:37,019 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 05:19:37,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:37,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:37,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:19:37,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:37,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 05:19:37,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:37,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 05:19:37,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2022-12-06 05:19:37,175 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 05:19:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1040787408, now seen corresponding path program 1 times [2022-12-06 05:19:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:37,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598677555] [2022-12-06 05:19:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:37,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598677555] [2022-12-06 05:19:37,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598677555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:37,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700833095] [2022-12-06 05:19:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:37,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:37,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:37,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:37,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 05:19:37,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:37,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:37,508 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:37,508 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:37,515 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 05:19:37,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:37,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:37,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:37,524 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:37,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:37,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:37,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,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 05:19:37,559 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:37,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:37,559 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:37,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:37,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,584 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:37,585 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:37,586 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 05:19:37,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:37,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:37,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:37,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:19:37,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:37,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 05:19:37,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:37,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:37,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2022-12-06 05:19:37,734 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 05:19:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash 702022927, now seen corresponding path program 1 times [2022-12-06 05:19:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:37,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771761348] [2022-12-06 05:19:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:37,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 05:19:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:37,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771761348] [2022-12-06 05:19:37,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771761348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:37,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:37,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:37,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047975838] [2022-12-06 05:19:37,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:37,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:37,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:37,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 05:19:37,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:37,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:37,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:38,107 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:38,107 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:38,113 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 05:19:38,118 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:38,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:38,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:38,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 05:19:38,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:38,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 05:19:38,147 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,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 05:19:38,147 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:38,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:38,147 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:38,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:38,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,171 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:38,172 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:19:38,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 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 05:19:38,174 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,174 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:38,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:38,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 05:19:38,376 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:38,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 05:19:38,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:38,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 05:19:38,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2022-12-06 05:19:38,377 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 05:19:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1850134034, now seen corresponding path program 1 times [2022-12-06 05:19:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:38,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878178377] [2022-12-06 05:19:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:38,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 05:19:38,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:38,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878178377] [2022-12-06 05:19:38,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878178377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:38,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:38,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:38,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069290177] [2022-12-06 05:19:38,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:38,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:38,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:38,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:38,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 05:19:38,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:38,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:38,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:38,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:38,717 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:38,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:38,731 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:38,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:38,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:38,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:38,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 05:19:38,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:38,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 05:19:38,763 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,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 05:19:38,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:38,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:38,763 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:38,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:38,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,788 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:38,788 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:19:38,789 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 05:19:38,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:38,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:38,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:38,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:19:38,943 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:38,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 05:19:38,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:38,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 05:19:38,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2022-12-06 05:19:38,943 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 05:19:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash -107323699, now seen corresponding path program 1 times [2022-12-06 05:19:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:38,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686328115] [2022-12-06 05:19:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19: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 05:19:38,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:38,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686328115] [2022-12-06 05:19:38,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686328115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:38,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:38,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505315354] [2022-12-06 05:19:38,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:38,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:38,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:38,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:38,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:38,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:39,266 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:39,267 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:39,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 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 05:19:39,281 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:39,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:39,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:39,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 05:19:39,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:39,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 05:19:39,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,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 05:19:39,315 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:39,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:39,315 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:39,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:39,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:39,348 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:39,349 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 05:19:39,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:39,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:39,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:19:39,498 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:39,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 05:19:39,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:39,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 05:19:39,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2022-12-06 05:19:39,498 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 05:19:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1635486636, now seen corresponding path program 1 times [2022-12-06 05:19:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:39,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437152168] [2022-12-06 05:19:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:39,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 05:19:39,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:39,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437152168] [2022-12-06 05:19:39,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437152168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:39,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:39,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990650938] [2022-12-06 05:19:39,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:39,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:39,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:39,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 05:19:39,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:39,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:39,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:39,841 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:39,841 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:19:39,848 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 05:19:39,855 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:39,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:39,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:39,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 05:19:39,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:39,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 05:19:39,887 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,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 05:19:39,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:39,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:39,887 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:39,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:39,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,913 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:39,913 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:19:39,914 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 05:19:39,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:39,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:40,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:40,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:19:40,069 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:40,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 05:19:40,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:40,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2022-12-06 05:19:40,070 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 05:19:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -916670325, now seen corresponding path program 1 times [2022-12-06 05:19:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:40,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350307623] [2022-12-06 05:19:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:40,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:40,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350307623] [2022-12-06 05:19:40,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350307623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:40,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:40,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42823683] [2022-12-06 05:19:40,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:40,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:40,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:40,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:40,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 05:19:40,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:40,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:40,419 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:40,419 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:19:40,426 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 05:19:40,434 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:40,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:40,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:40,435 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:40,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:40,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 05:19:40,469 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:40,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:40,469 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:40,469 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:40,469 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:40,470 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:40,470 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:40,470 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:40,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:40,494 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:40,494 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:19:40,495 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 05:19:40,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:40,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:40,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:40,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:19:40,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:40,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 05:19:40,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:40,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 05:19:40,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2022-12-06 05:19:40,664 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 05:19:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 826140010, now seen corresponding path program 1 times [2022-12-06 05:19:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:40,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620870970] [2022-12-06 05:19:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:40,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 05:19:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620870970] [2022-12-06 05:19:40,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620870970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:40,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:40,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275679838] [2022-12-06 05:19:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:40,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:40,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:40,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 05:19:40,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:40,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:40,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:41,026 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:41,026 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:41,034 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 05:19:41,043 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:41,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:41,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:41,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 05:19:41,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:41,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:41,083 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,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 05:19:41,083 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:41,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:41,083 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:41,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:41,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,111 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:41,111 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:19:41,112 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 05:19:41,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:41,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:41,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:19:41,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:41,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 05:19:41,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:41,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 05:19:41,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2022-12-06 05:19:41,265 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 05:19:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1726016951, now seen corresponding path program 1 times [2022-12-06 05:19:41,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:41,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829084595] [2022-12-06 05:19:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:41,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 05:19:41,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:41,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829084595] [2022-12-06 05:19:41,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829084595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:41,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:41,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099100949] [2022-12-06 05:19:41,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:41,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:41,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:41,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:41,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 05:19:41,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:41,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:41,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:41,624 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:41,624 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:41,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:41,639 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:41,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:41,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:41,640 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:41,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:41,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:41,675 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:41,675 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:41,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:41,675 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:41,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:41,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,702 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:41,702 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:41,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 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 05:19:41,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:41,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:41,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:41,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:19:41,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:41,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 05:19:41,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:41,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 05:19:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2022-12-06 05:19:41,859 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 05:19:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash 16793384, now seen corresponding path program 1 times [2022-12-06 05:19:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075052608] [2022-12-06 05:19:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:41,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 05:19:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:41,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075052608] [2022-12-06 05:19:41,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075052608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:41,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:41,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:41,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243156917] [2022-12-06 05:19:41,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:41,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:41,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:41,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:41,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:41,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:41,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 05:19:41,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:41,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:41,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:42,247 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:42,247 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:42,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:42,260 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:42,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:42,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:42,261 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:42,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:42,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 05:19:42,292 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,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 05:19:42,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:42,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:42,292 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:42,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:42,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,317 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:42,318 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:19:42,319 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 05:19:42,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:42,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:42,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:19:42,464 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:42,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 05:19:42,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:42,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 05:19:42,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2022-12-06 05:19:42,464 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 05:19:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1759603719, now seen corresponding path program 1 times [2022-12-06 05:19:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:42,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000456500] [2022-12-06 05:19:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:42,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 05:19:42,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:42,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000456500] [2022-12-06 05:19:42,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000456500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:42,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:42,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401864782] [2022-12-06 05:19:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:42,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:42,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:42,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:42,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 05:19:42,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:42,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:42,787 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:42,787 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:42,793 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 05:19:42,801 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:42,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:42,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:42,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 05:19:42,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:42,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:42,833 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:42,833 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:42,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:42,834 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:42,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:42,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,859 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:42,859 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:19:42,860 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 05:19:42,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:42,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:43,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:43,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:19:43,005 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:43,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 05:19:43,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:43,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 05:19:43,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2022-12-06 05:19:43,005 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 05:19:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:43,005 INFO L85 PathProgramCache]: Analyzing trace with hash -792553242, now seen corresponding path program 1 times [2022-12-06 05:19:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:43,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625435063] [2022-12-06 05:19:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:43,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 05:19:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:43,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625435063] [2022-12-06 05:19:43,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625435063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:43,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:43,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593866235] [2022-12-06 05:19:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:43,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:43,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:43,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 05:19:43,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:43,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:43,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:43,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:43,375 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:43,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 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 05:19:43,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:43,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:43,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:43,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 05:19:43,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:43,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 05:19:43,416 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:43,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 05:19:43,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:43,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:43,416 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:43,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:43,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:43,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:43,441 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:43,442 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:43,443 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 05:19:43,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:43,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:43,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:43,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:19:43,604 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:43,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 05:19:43,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:43,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 05:19:43,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2022-12-06 05:19:43,605 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 05:19:43,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash 950257093, now seen corresponding path program 1 times [2022-12-06 05:19:43,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:43,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048076726] [2022-12-06 05:19:43,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:43,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 05:19:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:43,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048076726] [2022-12-06 05:19:43,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048076726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:43,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:43,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:43,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553304339] [2022-12-06 05:19:43,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:43,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:43,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:43,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:43,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:43,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:43,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:43,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:43,974 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:43,974 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:43,993 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:43,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:43,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:43,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 05:19:43,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:44,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 05:19:44,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,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 05:19:44,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:44,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:44,031 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:44,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:44,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,058 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:44,058 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:44,060 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 05:19:44,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:44,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:44,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:19:44,223 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:44,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 05:19:44,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:44,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 05:19:44,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2022-12-06 05:19:44,224 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 05:19:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1601899868, now seen corresponding path program 1 times [2022-12-06 05:19:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:44,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555871890] [2022-12-06 05:19:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555871890] [2022-12-06 05:19:44,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555871890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:44,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:44,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383381986] [2022-12-06 05:19:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:44,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:44,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:44,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 05:19:44,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:44,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:44,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:44,564 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:44,565 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:44,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 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 05:19:44,579 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:44,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:44,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:44,580 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:44,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:44,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 05:19:44,612 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,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 05:19:44,613 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:44,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:44,613 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:44,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:44,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,646 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:44,646 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:19:44,647 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 05:19:44,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:44,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:44,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:44,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:19:44,810 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:44,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 05:19:44,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:44,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 05:19:44,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2022-12-06 05:19:44,811 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 05:19:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash 140910467, now seen corresponding path program 1 times [2022-12-06 05:19:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:44,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991943586] [2022-12-06 05:19:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:44,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991943586] [2022-12-06 05:19:44,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991943586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:44,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:44,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:44,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762842222] [2022-12-06 05:19:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:44,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:44,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:44,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:44,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 05:19:44,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:44,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:44,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:45,137 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:45,138 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:19:45,144 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 05:19:45,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:45,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:45,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:45,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 05:19:45,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:45,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 05:19:45,187 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,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 05:19:45,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:45,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:45,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:45,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:45,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,212 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:45,212 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:19:45,213 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 05:19:45,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:45,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:45,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:19:45,361 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:45,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 05:19:45,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:45,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 05:19:45,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2022-12-06 05:19:45,361 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 05:19:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1883720802, now seen corresponding path program 1 times [2022-12-06 05:19:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:45,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715141620] [2022-12-06 05:19:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:45,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 05:19:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:45,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715141620] [2022-12-06 05:19:45,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715141620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:45,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:45,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471048689] [2022-12-06 05:19:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:45,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:45,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:45,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:45,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:45,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 05:19:45,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:45,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:45,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:45,699 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:45,700 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:45,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 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 05:19:45,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:45,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:45,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:45,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 05:19:45,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:45,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 05:19:45,750 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:45,750 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:45,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:45,750 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:45,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:45,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,776 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:45,776 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:19:45,777 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 05:19:45,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:45,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:45,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:45,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:19:45,934 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:45,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 05:19:45,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:45,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 05:19:45,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2022-12-06 05:19:45,935 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 05:19:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -668436159, now seen corresponding path program 1 times [2022-12-06 05:19:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:45,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657904679] [2022-12-06 05:19:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:46,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 05:19:46,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:46,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657904679] [2022-12-06 05:19:46,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657904679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:46,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:46,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:46,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355762680] [2022-12-06 05:19:46,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:46,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:46,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:46,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:46,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:46,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 05:19:46,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:46,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:46,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:46,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:46,284 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:46,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 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 05:19:46,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:46,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:46,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:46,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 05:19:46,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:46,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 05:19:46,332 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,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 05:19:46,332 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:46,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:46,333 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:46,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:46,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,357 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:46,358 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:19:46,359 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 05:19:46,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:46,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:46,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:19:46,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:46,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 05:19:46,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:46,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 05:19:46,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2022-12-06 05:19:46,516 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 05:19:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1074374176, now seen corresponding path program 1 times [2022-12-06 05:19:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:46,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835705251] [2022-12-06 05:19:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:46,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 05:19:46,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:46,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835705251] [2022-12-06 05:19:46,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835705251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:46,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:46,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:46,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595982018] [2022-12-06 05:19:46,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:46,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:46,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:46,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:46,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 05:19:46,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:46,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:46,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:46,856 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:46,857 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:46,864 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 05:19:46,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:46,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:46,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:46,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 05:19:46,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:46,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 05:19:46,908 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:46,908 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:46,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:46,908 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:46,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:46,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,933 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:46,933 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:19:46,934 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 05:19:46,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:46,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:47,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:47,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:19:47,080 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:47,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:47,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:47,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:47,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2022-12-06 05:19:47,080 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 05:19:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1477782785, now seen corresponding path program 1 times [2022-12-06 05:19:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426779878] [2022-12-06 05:19:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:47,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 05:19:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:47,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426779878] [2022-12-06 05:19:47,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426779878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:47,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:47,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154141129] [2022-12-06 05:19:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:47,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:47,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:47,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:47,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:47,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 05:19:47,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:47,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:47,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:47,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:47,444 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:47,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:47,457 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:47,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:47,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:47,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 05:19:47,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:47,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 05:19:47,488 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:47,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 05:19:47,488 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:47,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:47,488 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:47,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:47,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:47,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:47,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:47,515 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:47,515 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:19:47,516 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 05:19:47,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:47,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:47,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:47,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:19:47,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:47,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 05:19:47,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:47,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 05:19:47,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2022-12-06 05:19:47,664 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 05:19:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash 265027550, now seen corresponding path program 1 times [2022-12-06 05:19:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:47,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238585623] [2022-12-06 05:19:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:47,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 05:19:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:47,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238585623] [2022-12-06 05:19:47,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238585623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:47,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:47,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946125141] [2022-12-06 05:19:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:47,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:47,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:47,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 05:19:47,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:47,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:47,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:48,014 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:48,014 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:19:48,021 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 05:19:48,029 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:48,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:48,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:48,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 05:19:48,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:48,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 05:19:48,062 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,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 05:19:48,063 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:48,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:48,063 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:48,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:48,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,090 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:48,091 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:19:48,092 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 05:19:48,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:48,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:48,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:19:48,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:48,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 05:19:48,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:48,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 05:19:48,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2022-12-06 05:19:48,235 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 05:19:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2007837885, now seen corresponding path program 1 times [2022-12-06 05:19:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124855082] [2022-12-06 05:19:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:48,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 05:19:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:48,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124855082] [2022-12-06 05:19:48,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124855082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:48,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:48,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730262831] [2022-12-06 05:19:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:48,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:48,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:48,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:48,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 05:19:48,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:48,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:48,612 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:48,612 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:48,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 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 05:19:48,624 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:48,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:48,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:48,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 05:19:48,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:48,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 05:19:48,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,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 05:19:48,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:48,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:48,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:48,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:48,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,685 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:48,686 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:48,687 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 05:19:48,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:48,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:48,828 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:48,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:19:48,828 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:48,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 05:19:48,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:48,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 05:19:48,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2022-12-06 05:19:48,829 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 05:19:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash -544319076, now seen corresponding path program 1 times [2022-12-06 05:19:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062515193] [2022-12-06 05:19:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062515193] [2022-12-06 05:19:48,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062515193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:48,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:48,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388242899] [2022-12-06 05:19:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:48,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:48,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:48,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:48,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:48,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:48,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:48,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:49,157 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:49,157 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:49,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 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 05:19:49,171 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:49,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:49,172 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:49,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 05:19:49,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:49,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 05:19:49,206 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,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 05:19:49,206 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:49,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:49,206 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:49,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:49,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,231 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:49,231 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:19:49,232 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 05:19:49,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:49,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:49,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:19:49,383 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:49,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:49,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:49,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:49,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2022-12-06 05:19:49,384 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 05:19:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1198491259, now seen corresponding path program 1 times [2022-12-06 05:19:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:49,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851154433] [2022-12-06 05:19:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19: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 05:19:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:49,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851154433] [2022-12-06 05:19:49,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851154433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:49,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:49,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155929137] [2022-12-06 05:19:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:49,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:49,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19: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 05:19:49,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:49,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:49,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:49,729 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:49,730 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:49,736 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 05:19:49,744 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:49,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:49,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:49,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 05:19:49,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:49,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:49,779 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:49,779 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:49,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:49,780 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:49,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:49,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,811 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:49,811 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:19:49,812 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 05:19:49,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:49,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:49,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:49,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:19:49,963 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:49,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 05:19:49,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:49,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 05:19:49,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2022-12-06 05:19:49,964 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 05:19:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1353665702, now seen corresponding path program 1 times [2022-12-06 05:19:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618327742] [2022-12-06 05:19:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:50,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 05:19:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618327742] [2022-12-06 05:19:50,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618327742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:50,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:50,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728680841] [2022-12-06 05:19:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:50,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:50,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:50,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:50,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:50,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:50,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:50,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:50,304 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:50,304 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:50,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:50,318 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:50,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:50,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:50,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 05:19:50,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:50,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 05:19:50,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,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 05:19:50,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:50,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:50,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:50,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:50,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,378 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:50,379 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:50,380 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 05:19:50,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:50,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:50,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:19:50,539 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:50,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:50,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:50,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:50,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2022-12-06 05:19:50,539 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 05:19:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 389144633, now seen corresponding path program 1 times [2022-12-06 05:19:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:50,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121585750] [2022-12-06 05:19:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121585750] [2022-12-06 05:19:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121585750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:50,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:50,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604485939] [2022-12-06 05:19:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:50,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:50,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 05:19:50,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:50,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:50,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:50,877 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:50,878 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:50,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:19:50,892 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:50,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:50,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:50,893 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:50,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:50,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 05:19:50,927 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,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 05:19:50,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:50,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:50,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:50,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:50,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:50,953 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:50,954 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 05:19:50,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:50,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:51,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:51,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:19:51,107 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:51,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:51,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:51,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:51,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2022-12-06 05:19:51,107 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 05:19:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2131954968, now seen corresponding path program 1 times [2022-12-06 05:19:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:51,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727920658] [2022-12-06 05:19:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:51,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727920658] [2022-12-06 05:19:51,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727920658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:51,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:51,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:51,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533235340] [2022-12-06 05:19:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:51,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:51,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:51,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 05:19:51,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:51,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:51,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:51,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:51,468 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:51,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 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 05:19:51,483 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:51,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:51,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:51,484 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:51,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:51,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 05:19:51,516 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:51,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 05:19:51,516 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:51,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:51,517 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:51,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:51,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:51,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:51,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:51,542 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:51,542 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:19:51,543 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 05:19:51,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:51,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:51,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:51,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:19:51,703 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:51,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 05:19:51,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:51,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 05:19:51,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2022-12-06 05:19:51,703 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 05:19:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash -420201993, now seen corresponding path program 1 times [2022-12-06 05:19:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:51,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856931640] [2022-12-06 05:19:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:51,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 05:19:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:51,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856931640] [2022-12-06 05:19:51,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856931640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:51,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:51,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620475696] [2022-12-06 05:19:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:51,773 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:51,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:51,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:51,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:51,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:52,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:52,048 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:52,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:52,063 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:52,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:52,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:52,064 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:52,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:52,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:52,097 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:52,097 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:52,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:52,098 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:52,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:52,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,128 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:52,128 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:19:52,129 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 05:19:52,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:52,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:52,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:19:52,286 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:52,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 05:19:52,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:52,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 05:19:52,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2022-12-06 05:19:52,286 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 05:19:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1322608342, now seen corresponding path program 1 times [2022-12-06 05:19:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:52,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44087628] [2022-12-06 05:19:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:52,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 05:19:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44087628] [2022-12-06 05:19:52,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44087628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:52,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:52,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982052443] [2022-12-06 05:19:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:52,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:52,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:52,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 05:19:52,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:52,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:52,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:52,626 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:52,626 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:52,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 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 05:19:52,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:52,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:52,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:52,640 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:52,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:52,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 05:19:52,672 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:52,672 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:52,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:52,672 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:52,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:52,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,697 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:52,698 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:52,699 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 05:19:52,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:52,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:52,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:52,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:19:52,853 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:52,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:52,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:52,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:52,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2022-12-06 05:19:52,854 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 05:19:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1229548619, now seen corresponding path program 1 times [2022-12-06 05:19:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:52,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990831638] [2022-12-06 05:19:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:52,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990831638] [2022-12-06 05:19:52,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990831638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:52,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:52,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216703846] [2022-12-06 05:19:52,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:52,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:52,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:52,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:52,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 05:19:52,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:52,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:52,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:53,200 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:53,200 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:19:53,207 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 05:19:53,215 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:53,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:53,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:53,216 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:53,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:53,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 05:19:53,249 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:53,249 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:53,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:53,249 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:53,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:53,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,274 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:19:53,274 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:19:53,275 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 05:19:53,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:53,444 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:53,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:19:53,444 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:53,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 05:19:53,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:53,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 05:19:53,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2022-12-06 05:19:53,445 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 05:19:53,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 513261716, now seen corresponding path program 1 times [2022-12-06 05:19:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:53,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049629833] [2022-12-06 05:19:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:53,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049629833] [2022-12-06 05:19:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049629833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:53,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:53,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364335069] [2022-12-06 05:19:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:53,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:53,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:53,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 05:19:53,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:53,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:53,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:53,801 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:53,801 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:53,807 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 05:19:53,814 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:53,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:53,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:53,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 05:19:53,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:53,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 05:19:53,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,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 05:19:53,845 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:53,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:53,845 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:53,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:53,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,870 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:53,871 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:19:53,872 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 05:19:53,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:53,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:54,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:54,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:19:54,042 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:54,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:54,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:54,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:54,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2022-12-06 05:19:54,042 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 05:19:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2038895245, now seen corresponding path program 1 times [2022-12-06 05:19:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:54,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430139000] [2022-12-06 05:19:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:54,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 05:19:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430139000] [2022-12-06 05:19:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430139000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:54,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:54,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:54,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383346297] [2022-12-06 05:19:54,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:54,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:54,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:54,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:54,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:54,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:54,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 05:19:54,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:54,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:54,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:54,378 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:54,378 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:54,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 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 05:19:54,392 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:54,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:54,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:54,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 05:19:54,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:54,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 05:19:54,427 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:54,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 05:19:54,427 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:54,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:54,427 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:54,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:54,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:54,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:54,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:54,452 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:54,453 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:19:54,454 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 05:19:54,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:54,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:54,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:54,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:19:54,618 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:54,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:54,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:54,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:54,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2022-12-06 05:19:54,618 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 05:19:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -296084910, now seen corresponding path program 1 times [2022-12-06 05:19:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:54,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155131393] [2022-12-06 05:19:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:54,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 05:19:54,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:54,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155131393] [2022-12-06 05:19:54,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155131393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:54,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:54,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339285184] [2022-12-06 05:19:54,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:54,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:54,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:54,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 05:19:54,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:54,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:54,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:54,964 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:54,964 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:54,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 05:19:54,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:54,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:54,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:54,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 05:19:54,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:55,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 05:19:55,039 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,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 05:19:55,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:55,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:55,040 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:55,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:55,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,067 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:55,068 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:19:55,069 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 05:19:55,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:55,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:55,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:19:55,237 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:55,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 05:19:55,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:55,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 05:19:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2022-12-06 05:19:55,238 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 05:19:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1446725425, now seen corresponding path program 1 times [2022-12-06 05:19:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:55,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656651880] [2022-12-06 05:19:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:55,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 05:19:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:55,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656651880] [2022-12-06 05:19:55,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656651880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:55,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:55,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52502243] [2022-12-06 05:19:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:55,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:55,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:55,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:55,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:55,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 05:19:55,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:55,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:55,568 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:55,569 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:55,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 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 05:19:55,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:55,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:55,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:55,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 05:19:55,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:55,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 05:19:55,619 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,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 05:19:55,620 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:55,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:55,620 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:55,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:55,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,645 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:55,645 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:19:55,646 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 05:19:55,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:55,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:55,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:55,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:19:55,791 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:55,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 05:19:55,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:55,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 05:19:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2022-12-06 05:19:55,791 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 05:19:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1105431536, now seen corresponding path program 1 times [2022-12-06 05:19:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:55,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688220718] [2022-12-06 05:19:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:55,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688220718] [2022-12-06 05:19:55,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688220718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:55,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:55,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362874989] [2022-12-06 05:19:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:55,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:55,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:55,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:55,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:55,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:55,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:56,125 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:56,125 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:56,132 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 05:19:56,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:56,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:56,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:56,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 05:19:56,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:56,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 05:19:56,173 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,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 05:19:56,173 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:56,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:56,174 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:56,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:56,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,198 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:56,198 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:19:56,199 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 05:19:56,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:56,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:56,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:19:56,346 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:56,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 05:19:56,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:56,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 05:19:56,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2022-12-06 05:19:56,346 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 05:19:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 637378799, now seen corresponding path program 1 times [2022-12-06 05:19:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:56,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904174136] [2022-12-06 05:19:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:56,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:56,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904174136] [2022-12-06 05:19:56,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904174136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:56,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:56,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:56,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416689265] [2022-12-06 05:19:56,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:56,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:56,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 05:19:56,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:56,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:56,702 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:56,702 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:56,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:19:56,716 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:56,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:56,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:56,717 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:19:56,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:56,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 05:19:56,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,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 05:19:56,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:56,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:56,751 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:56,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:56,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,777 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:56,777 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:56,778 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 05:19:56,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:56,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:56,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:56,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:19:56,925 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:56,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 05:19:56,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:56,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 05:19:56,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2022-12-06 05:19:56,926 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 05:19:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1914778162, now seen corresponding path program 1 times [2022-12-06 05:19:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:56,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757480736] [2022-12-06 05:19:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:56,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:56,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 05:19:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:56,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757480736] [2022-12-06 05:19:56,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757480736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:56,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:56,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232476374] [2022-12-06 05:19:56,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:56,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:56,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:56,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:56,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:56,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 05:19:56,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:56,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:56,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:57,257 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:57,257 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:19:57,264 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 05:19:57,272 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:57,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:57,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:57,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 05:19:57,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:57,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:57,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,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 05:19:57,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:57,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:57,306 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:57,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:57,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,332 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:57,332 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:19:57,333 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 05:19:57,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:57,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:57,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:19:57,483 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:57,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 05:19:57,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:57,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 05:19:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2022-12-06 05:19:57,483 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 05:19:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash -171967827, now seen corresponding path program 1 times [2022-12-06 05:19:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:57,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529528310] [2022-12-06 05:19:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:57,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 05:19:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529528310] [2022-12-06 05:19:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529528310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:57,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:57,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101801563] [2022-12-06 05:19:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:57,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:57,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:57,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 05:19:57,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:57,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:57,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:57,813 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:57,813 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:57,820 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 05:19:57,827 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:57,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:57,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:57,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 05:19:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:57,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 05:19:57,858 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:57,858 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:57,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:57,858 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:57,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:57,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,883 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:57,883 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:19:57,884 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 05:19:57,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:57,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:58,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:58,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:19:58,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:58,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 05:19:58,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:58,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 05:19:58,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2022-12-06 05:19:58,037 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 05:19:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1570842508, now seen corresponding path program 1 times [2022-12-06 05:19:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:58,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006903449] [2022-12-06 05:19:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:58,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 05:19:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:58,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006903449] [2022-12-06 05:19:58,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006903449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:58,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:58,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039181049] [2022-12-06 05:19:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:58,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:58,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:58,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 05:19:58,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:58,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:58,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:58,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:58,374 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:19:58,382 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 05:19:58,389 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:58,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:58,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:58,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 05:19:58,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:58,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 05:19:58,422 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,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 05:19:58,423 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:58,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:58,423 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:58,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:58,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,448 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:58,448 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:19:58,449 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 05:19:58,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:58,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:58,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:19:58,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:58,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 05:19:58,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:58,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 05:19:58,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2022-12-06 05:19:58,601 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 05:19:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash -981314453, now seen corresponding path program 1 times [2022-12-06 05:19:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:58,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090050404] [2022-12-06 05:19:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19: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 05:19:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:58,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090050404] [2022-12-06 05:19:58,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090050404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:58,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:58,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134354420] [2022-12-06 05:19:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:58,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:58,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19: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 05:19:58,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:58,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:58,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:58,951 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:58,951 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19: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 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 05:19:58,964 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:58,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:58,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:58,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 05:19:58,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:58,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 05:19:58,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,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 05:19:58,996 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:58,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:58,996 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:58,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:58,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:58,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,020 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:59,021 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:19:59,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 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 05:19:59,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:59,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:59,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:19:59,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:59,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 05:19:59,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:59,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 05:19:59,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2022-12-06 05:19:59,162 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 05:19:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash 761495882, now seen corresponding path program 1 times [2022-12-06 05:19:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:59,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640500831] [2022-12-06 05:19:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:59,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 05:19:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:59,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640500831] [2022-12-06 05:19:59,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640500831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:59,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:59,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868098982] [2022-12-06 05:19:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:59,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:59,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:59,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:59,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:59,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 05:19:59,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:59,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:59,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:59,487 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:19:59,487 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:19:59,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 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 05:19:59,501 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:19:59,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:19:59,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:19:59,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 05:19:59,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:19:59,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:59,535 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:19:59,536 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:19:59,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:59,536 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,536 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:59,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:59,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,561 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:19:59,561 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:19:59,562 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 05:19:59,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:19:59,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:19:59,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:59,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:19:59,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:19:59,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 05:19:59,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:59,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 05:19:59,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2022-12-06 05:19:59,732 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 05:19:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1790661079, now seen corresponding path program 1 times [2022-12-06 05:19:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:59,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456274112] [2022-12-06 05:19:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:59,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456274112] [2022-12-06 05:19:59,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456274112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:59,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:59,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:19:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002498745] [2022-12-06 05:19:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:59,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:59,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:19:59,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:59,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:59,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:19:59,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:00,173 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:00,173 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:00,183 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 05:20:00,193 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:00,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:00,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:00,194 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:00,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:00,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 05:20:00,287 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,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 05:20:00,287 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:00,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:00,287 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:00,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:00,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,312 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:00,312 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:00,313 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 05:20:00,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:00,471 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:00,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:20:00,472 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:00,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 05:20:00,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:00,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 05:20:00,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2022-12-06 05:20:00,472 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 05:20:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:00,472 INFO L85 PathProgramCache]: Analyzing trace with hash -47850744, now seen corresponding path program 1 times [2022-12-06 05:20:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:00,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108990874] [2022-12-06 05:20:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:00,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:00,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 05:20:00,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:00,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108990874] [2022-12-06 05:20:00,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108990874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:00,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:00,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632339953] [2022-12-06 05:20:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:00,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:00,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:00,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:00,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:00,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 05:20:00,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:00,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:00,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:00,818 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:00,818 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:00,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:00,833 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:00,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:00,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:00,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 05:20:00,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:00,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 05:20:00,866 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:00,867 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:00,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:00,867 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:00,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:00,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,892 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:00,892 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:20:00,893 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 05:20:00,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:00,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:01,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:01,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:20:01,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:01,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 05:20:01,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:01,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 05:20:01,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2022-12-06 05:20:01,039 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 05:20:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1694959591, now seen corresponding path program 1 times [2022-12-06 05:20:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:01,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704099891] [2022-12-06 05:20:01,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:01,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 05:20:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:01,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704099891] [2022-12-06 05:20:01,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704099891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:01,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:01,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:01,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531436810] [2022-12-06 05:20:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:01,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:01,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:01,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:01,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:01,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 05:20:01,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:01,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:01,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:01,378 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:01,378 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20: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 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 05:20:01,393 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:01,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:01,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:01,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 05:20:01,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:01,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 05:20:01,428 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:01,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 05:20:01,428 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:01,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:01,428 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:01,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:01,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:01,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:01,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:01,453 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:01,453 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:01,454 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 05:20:01,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:01,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:01,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:01,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:20:01,612 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:01,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 05:20:01,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:01,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 05:20:01,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2022-12-06 05:20:01,613 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 05:20:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -857197370, now seen corresponding path program 1 times [2022-12-06 05:20:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:01,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369751469] [2022-12-06 05:20:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:01,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:01,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369751469] [2022-12-06 05:20:01,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369751469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:01,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:01,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473220195] [2022-12-06 05:20:01,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:01,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:01,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:01,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:01,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:01,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 05:20:01,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:01,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:01,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:01,962 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:01,962 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:01,969 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 05:20:01,976 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:01,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:01,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20: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 05:20:01,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:02,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 05:20:02,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,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 05:20:02,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:02,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:02,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:02,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:02,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,035 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:02,035 INFO L131 PetriNetUnfolder]: For 3112/3253 co-relation queries the response was YES. [2022-12-06 05:20:02,036 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 05:20:02,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:02,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:02,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:20:02,179 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:02,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:02,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:02,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 05:20:02,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2022-12-06 05:20:02,180 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 05:20:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash 885612965, now seen corresponding path program 1 times [2022-12-06 05:20:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:02,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716434890] [2022-12-06 05:20:02,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20: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 05:20:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:02,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716434890] [2022-12-06 05:20:02,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716434890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:02,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:02,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578600193] [2022-12-06 05:20:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:02,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20: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 05:20:02,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:02,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:02,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:02,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:02,502 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:02,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 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 05:20:02,517 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:02,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:02,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:02,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 05:20:02,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:02,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:02,551 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:02,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:02,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:02,552 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:02,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:02,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,577 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:02,577 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:02,578 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 05:20:02,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:02,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:02,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:02,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:02,727 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:02,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:02,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:02,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:02,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2022-12-06 05:20:02,727 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 05:20:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1666543996, now seen corresponding path program 1 times [2022-12-06 05:20:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:02,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304426595] [2022-12-06 05:20:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:02,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304426595] [2022-12-06 05:20:02,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304426595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:02,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:02,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028439741] [2022-12-06 05:20:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:02,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:02,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:02,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:02,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:02,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:03,079 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:03,080 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:03,086 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 05:20:03,094 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:03,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:03,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:03,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:03,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 05:20:03,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:03,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 05:20:03,125 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,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 05:20:03,125 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:03,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:03,125 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:03,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:03,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,150 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:03,150 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:20:03,151 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 05:20:03,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:03,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:03,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:20:03,305 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:03,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 05:20:03,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:03,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 05:20:03,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2022-12-06 05:20:03,305 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 05:20:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash 76266339, now seen corresponding path program 1 times [2022-12-06 05:20:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:03,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002402406] [2022-12-06 05:20:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:03,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 05:20:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:03,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002402406] [2022-12-06 05:20:03,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002402406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:03,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:03,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492691532] [2022-12-06 05:20:03,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:03,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:03,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:03,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:03,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:03,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:03,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:03,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:03,681 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:03,681 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:03,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 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 05:20:03,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:03,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:03,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:03,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 05:20:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:03,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:03,729 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,729 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:03,730 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:03,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:03,730 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:03,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:03,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,755 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:03,755 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:20:03,756 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 05:20:03,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:03,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:03,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:03,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:20:03,910 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:03,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 05:20:03,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:03,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2022-12-06 05:20:03,911 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 05:20:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1819076674, now seen corresponding path program 1 times [2022-12-06 05:20:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990232362] [2022-12-06 05:20:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:03,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 05:20:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:03,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990232362] [2022-12-06 05:20:03,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990232362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:03,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:03,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714431717] [2022-12-06 05:20:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:03,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:03,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:03,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:03,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:03,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:04,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:04,279 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:04,286 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 05:20:04,293 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:04,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:04,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:04,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 05:20:04,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:04,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 05:20:04,325 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:04,325 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:04,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:04,325 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:04,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:04,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,350 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:04,350 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:20:04,351 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 05:20:04,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:04,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:04,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:04,500 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:04,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 05:20:04,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:04,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 05:20:04,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2022-12-06 05:20:04,500 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 05:20:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -733080287, now seen corresponding path program 1 times [2022-12-06 05:20:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:04,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122297544] [2022-12-06 05:20:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:04,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 05:20:04,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122297544] [2022-12-06 05:20:04,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122297544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:04,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:04,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446223263] [2022-12-06 05:20:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:04,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:04,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:04,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 05:20:04,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:04,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:04,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:04,843 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:04,843 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:04,850 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 05:20:04,858 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:04,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:04,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:04,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 05:20:04,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:04,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 05:20:04,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,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 05:20:04,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:04,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:04,894 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:04,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:04,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,919 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:04,919 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:04,920 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 05:20:04,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:04,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:05,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:05,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:20:05,065 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:05,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 05:20:05,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:05,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 05:20:05,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2022-12-06 05:20:05,065 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 05:20:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1009730048, now seen corresponding path program 1 times [2022-12-06 05:20:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:05,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393679657] [2022-12-06 05:20:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:05,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 05:20:05,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:05,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393679657] [2022-12-06 05:20:05,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393679657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:05,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:05,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451328133] [2022-12-06 05:20:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:05,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:05,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:05,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:05,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 05:20:05,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:05,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:05,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:05,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:05,420 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:05,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 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 05:20:05,432 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:05,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:05,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:05,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 05:20:05,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:05,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 05:20:05,462 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:05,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:05,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:05,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:05,462 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:05,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:05,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:05,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:05,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:05,488 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:05,488 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:20:05,489 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 05:20:05,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:05,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:05,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:05,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:20:05,633 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:05,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:05,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:05,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:05,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2022-12-06 05:20:05,633 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 05:20:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1542426913, now seen corresponding path program 1 times [2022-12-06 05:20:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:05,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81701986] [2022-12-06 05:20:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:05,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 05:20:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:05,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81701986] [2022-12-06 05:20:05,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81701986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:05,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750169852] [2022-12-06 05:20:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:05,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:05,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:05,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 05:20:05,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:05,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:05,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:05,985 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:05,986 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:05,992 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 05:20:06,000 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:06,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:06,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:06,001 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:06,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:06,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 05:20:06,034 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:06,034 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:06,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:06,034 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:06,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:06,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,059 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:06,059 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:06,060 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 05:20:06,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:06,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:06,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 05:20:06,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:06,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 05:20:06,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:06,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 05:20:06,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2022-12-06 05:20:06,243 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 05:20:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 200383422, now seen corresponding path program 1 times [2022-12-06 05:20:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:06,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271469710] [2022-12-06 05:20:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:06,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271469710] [2022-12-06 05:20:06,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271469710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:06,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:06,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685015162] [2022-12-06 05:20:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:06,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:06,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:06,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 05:20:06,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:06,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:06,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:06,672 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:06,672 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:06,679 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 05:20:06,686 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:06,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:06,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:06,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 05:20:06,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:06,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 05:20:06,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,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 05:20:06,735 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:06,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:06,735 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:06,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:06,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,786 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:06,786 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:06,787 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 05:20:06,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:06,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:06,975 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:06,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 05:20:06,976 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:06,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:06,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:06,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:06,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2022-12-06 05:20:06,976 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 05:20:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1943193757, now seen corresponding path program 1 times [2022-12-06 05:20:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:06,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139708746] [2022-12-06 05:20:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:07,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 05:20:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:07,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139708746] [2022-12-06 05:20:07,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139708746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:07,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:07,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146409967] [2022-12-06 05:20:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:07,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:07,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:07,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 05:20:07,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:07,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:07,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:07,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:07,417 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:07,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 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 05:20:07,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:07,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:07,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:07,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 05:20:07,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:07,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:07,463 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:07,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 05:20:07,463 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:07,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:07,463 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:07,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:07,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:07,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:07,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:07,488 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:07,488 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:07,489 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 05:20:07,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:07,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:07,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:07,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:20:07,645 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:07,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 05:20:07,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:07,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 05:20:07,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2022-12-06 05:20:07,645 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 05:20:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -608963204, now seen corresponding path program 1 times [2022-12-06 05:20:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194897700] [2022-12-06 05:20:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:07,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 05:20:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:07,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194897700] [2022-12-06 05:20:07,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194897700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:07,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:07,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701182595] [2022-12-06 05:20:07,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:07,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:07,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:07,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:07,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 05:20:07,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:07,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:07,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:07,966 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:07,966 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:07,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:07,981 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:07,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:07,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:07,982 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:07,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:08,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 05:20:08,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,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 05:20:08,015 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:08,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:08,015 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:08,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:08,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,040 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:08,040 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:20:08,041 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 05:20:08,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:08,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:08,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:08,189 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:08,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:08,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:08,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2022-12-06 05:20:08,190 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 05:20:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1133847131, now seen corresponding path program 1 times [2022-12-06 05:20:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:08,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550328199] [2022-12-06 05:20:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:08,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 05:20:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:08,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550328199] [2022-12-06 05:20:08,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550328199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:08,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:08,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845755705] [2022-12-06 05:20:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:08,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:08,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:08,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 05:20:08,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:08,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:08,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:08,559 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:08,559 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:08,566 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 05:20:08,574 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:08,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:08,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:08,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 05:20:08,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:08,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 05:20:08,606 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,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 05:20:08,606 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:08,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:08,606 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:08,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:08,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,631 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:08,631 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:08,632 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 05:20:08,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:08,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:08,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:08,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:20:08,775 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:08,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 05:20:08,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:08,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 05:20:08,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2022-12-06 05:20:08,776 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 05:20:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1418309830, now seen corresponding path program 1 times [2022-12-06 05:20:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:08,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464537493] [2022-12-06 05:20:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:08,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 05:20:08,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:08,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464537493] [2022-12-06 05:20:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464537493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:08,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:08,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124461116] [2022-12-06 05:20:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:08,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:08,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:08,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 05:20:08,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:08,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:08,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:09,127 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:09,127 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:09,134 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 05:20:09,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:09,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:09,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:09,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 05:20:09,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:09,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 05:20:09,174 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,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 05:20:09,175 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:09,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:09,175 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:09,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:09,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,200 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:09,200 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:20:09,201 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 05:20:09,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:09,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:09,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:20:09,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:09,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 05:20:09,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:09,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 05:20:09,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2022-12-06 05:20:09,349 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 05:20:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 324500505, now seen corresponding path program 1 times [2022-12-06 05:20:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:09,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182003191] [2022-12-06 05:20:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:09,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 05:20:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:09,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182003191] [2022-12-06 05:20:09,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182003191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:09,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:09,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97600125] [2022-12-06 05:20:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:09,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:09,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:09,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:09,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 05:20:09,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:09,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:09,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:09,704 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:09,704 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:09,711 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 05:20:09,718 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:09,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:09,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:09,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 05:20:09,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:09,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:09,749 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:09,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:09,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:09,749 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:09,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:09,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,774 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:09,774 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:09,776 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 05:20:09,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:09,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:09,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:09,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:20:09,926 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:09,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 05:20:09,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:09,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 05:20:09,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2022-12-06 05:20:09,926 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 05:20:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:09,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2067310840, now seen corresponding path program 1 times [2022-12-06 05:20:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:09,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384224109] [2022-12-06 05:20:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:09,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384224109] [2022-12-06 05:20:09,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384224109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:09,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:09,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045644612] [2022-12-06 05:20:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:09,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:09,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:09,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:09,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:09,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:09,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:10,277 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:10,277 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:10,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 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 05:20:10,292 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:10,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:10,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:10,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 05:20:10,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:10,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:10,326 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:10,326 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:10,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:10,326 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:10,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:10,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,351 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:10,351 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:20:10,352 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 05:20:10,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:10,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:10,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:20:10,500 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:10,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 05:20:10,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:10,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 05:20:10,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2022-12-06 05:20:10,500 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 05:20:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash -484846121, now seen corresponding path program 1 times [2022-12-06 05:20:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:10,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902874471] [2022-12-06 05:20:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:10,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 05:20:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902874471] [2022-12-06 05:20:10,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902874471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:10,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:10,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459185835] [2022-12-06 05:20:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:10,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:10,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:10,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 05:20:10,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:10,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:10,865 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:10,865 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:10,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:10,877 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:10,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:10,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:10,877 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:10,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:10,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 05:20:10,907 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:10,908 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:10,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:10,908 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:10,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:10,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,937 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:10,937 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:20:10,938 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 05:20:10,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:10,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:11,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:11,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:20:11,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:11,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 05:20:11,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:11,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 05:20:11,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2022-12-06 05:20:11,087 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 05:20:11,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1257964214, now seen corresponding path program 1 times [2022-12-06 05:20:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:11,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766508972] [2022-12-06 05:20:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:11,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 05:20:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:11,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766508972] [2022-12-06 05:20:11,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766508972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:11,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:11,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723111426] [2022-12-06 05:20:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:11,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:11,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:11,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 05:20:11,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:11,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:11,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:11,428 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:11,429 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:11,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:11,443 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:11,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:11,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:11,444 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:11,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:11,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:11,477 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:11,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 05:20:11,477 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:11,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:11,477 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:11,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:11,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:11,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:11,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:11,503 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:11,503 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:11,504 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 05:20:11,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:11,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:11,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:11,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:20:11,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:11,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 05:20:11,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:11,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 05:20:11,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2022-12-06 05:20:11,661 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 05:20:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1294192747, now seen corresponding path program 1 times [2022-12-06 05:20:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:11,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536091897] [2022-12-06 05:20:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:11,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:11,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 05:20:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:11,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536091897] [2022-12-06 05:20:11,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536091897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:11,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:11,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817132901] [2022-12-06 05:20:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:11,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:11,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 05:20:11,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:11,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:11,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:11,986 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:11,986 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:11,994 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 05:20:12,002 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:12,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:12,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:12,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 05:20:12,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:12,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:12,036 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:12,036 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:12,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:12,036 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:12,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:12,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,067 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:12,068 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:20:12,069 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 05:20:12,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:12,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:12,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:20:12,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:12,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 05:20:12,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:12,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 05:20:12,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2022-12-06 05:20:12,229 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 05:20:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 448617588, now seen corresponding path program 1 times [2022-12-06 05:20:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410529086] [2022-12-06 05:20:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:12,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 05:20:12,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:12,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410529086] [2022-12-06 05:20:12,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410529086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:12,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:12,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:12,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356492441] [2022-12-06 05:20:12,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:12,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:12,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:12,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:12,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 05:20:12,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:12,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:12,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:12,569 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:12,569 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:12,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:12,584 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:12,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:12,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:12,585 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:12,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:12,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:12,616 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,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 05:20:12,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:12,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:12,617 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:12,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:12,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,641 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:12,642 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:20:12,643 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 05:20:12,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:12,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:12,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:12,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:20:12,783 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:12,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 05:20:12,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:12,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 05:20:12,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2022-12-06 05:20:12,783 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 05:20:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2103539373, now seen corresponding path program 1 times [2022-12-06 05:20:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:12,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200982867] [2022-12-06 05:20:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:12,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 05:20:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200982867] [2022-12-06 05:20:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200982867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:12,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:12,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148810217] [2022-12-06 05:20:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:12,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:12,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:12,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 05:20:12,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:12,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:12,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:13,123 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:13,123 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:13,130 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 05:20:13,137 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:13,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:13,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:13,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 05:20:13,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:13,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 05:20:13,170 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,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 05:20:13,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:13,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:13,171 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:13,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:13,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,195 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:13,196 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:20:13,197 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 05:20:13,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:13,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:13,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:20:13,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:13,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 05:20:13,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:13,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 05:20:13,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2022-12-06 05:20:13,353 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 05:20:13,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash -360729038, now seen corresponding path program 1 times [2022-12-06 05:20:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:13,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113007665] [2022-12-06 05:20:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:13,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 05:20:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113007665] [2022-12-06 05:20:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113007665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222759283] [2022-12-06 05:20:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:13,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:13,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:13,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 05:20:13,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:13,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:13,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:13,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:13,684 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:13,691 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 05:20:13,699 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:13,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:13,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:13,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 05:20:13,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:13,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:13,731 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:13,732 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:13,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:13,732 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:13,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:13,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,757 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:13,757 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:13,758 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 05:20:13,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:13,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:13,903 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:13,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:20:13,904 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:13,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:13,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:13,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2022-12-06 05:20:13,904 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 05:20:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1382081297, now seen corresponding path program 1 times [2022-12-06 05:20:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:13,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192549562] [2022-12-06 05:20:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:13,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 05:20:13,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192549562] [2022-12-06 05:20:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192549562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:13,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620921301] [2022-12-06 05:20:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:13,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:13,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:13,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:13,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 05:20:13,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:13,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:13,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:14,245 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:14,245 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:14,252 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 05:20:14,259 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:14,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:14,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:14,260 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:14,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:14,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 05:20:14,293 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,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 05:20:14,293 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:14,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:14,293 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:14,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:14,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,318 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:14,318 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:14,319 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 05:20:14,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:14,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:14,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:14,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:14,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 05:20:14,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:14,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 05:20:14,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2022-12-06 05:20:14,467 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 05:20:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1170075664, now seen corresponding path program 1 times [2022-12-06 05:20:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366019240] [2022-12-06 05:20:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:14,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 05:20:14,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:14,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366019240] [2022-12-06 05:20:14,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366019240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:14,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:14,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060987495] [2022-12-06 05:20:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:14,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:14,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 05:20:14,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:14,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:14,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:14,802 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:14,802 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:14,809 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 05:20:14,816 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:14,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:14,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:14,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 05:20:14,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:14,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 05:20:14,848 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:14,848 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:14,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:14,848 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:14,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:14,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,872 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:14,873 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:20:14,874 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 05:20:14,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:14,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:15,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:15,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:20:15,020 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:15,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 05:20:15,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:15,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 05:20:15,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2022-12-06 05:20:15,021 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 05:20:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 572734671, now seen corresponding path program 1 times [2022-12-06 05:20:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:15,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853532697] [2022-12-06 05:20:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:15,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 05:20:15,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:15,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853532697] [2022-12-06 05:20:15,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853532697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:15,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:15,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:15,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289663326] [2022-12-06 05:20:15,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:15,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:15,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:15,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 05:20:15,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:15,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:15,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:15,364 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:15,364 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:15,370 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 05:20:15,378 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:15,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:15,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:15,379 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:15,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:15,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 05:20:15,414 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,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 05:20:15,414 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:15,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:15,414 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:15,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:15,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,438 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:15,439 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:20:15,440 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 05:20:15,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:15,593 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:15,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:20:15,593 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:15,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:15,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:15,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:15,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2022-12-06 05:20:15,594 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 05:20:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1979422290, now seen corresponding path program 1 times [2022-12-06 05:20:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:15,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812394679] [2022-12-06 05:20:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:15,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:15,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812394679] [2022-12-06 05:20:15,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812394679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:15,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:15,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988682646] [2022-12-06 05:20:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:15,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:15,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:15,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:15,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:15,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:15,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:15,944 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:15,944 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:15,950 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 05:20:15,956 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:15,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:15,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:15,957 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:15,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 05:20:15,986 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:15,986 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:15,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:15,986 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:15,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:15,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,011 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:16,011 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:20:16,012 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 05:20:16,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:16,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:16,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:16,160 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:16,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 05:20:16,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:16,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 05:20:16,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2022-12-06 05:20:16,160 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 05:20:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -236611955, now seen corresponding path program 1 times [2022-12-06 05:20:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:16,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648707235] [2022-12-06 05:20:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:16,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 05:20:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:16,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648707235] [2022-12-06 05:20:16,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648707235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:16,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:16,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283480541] [2022-12-06 05:20:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:16,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:16,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:16,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 05:20:16,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:16,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:16,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:16,489 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:16,489 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:20:16,496 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 05:20:16,503 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:16,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:16,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:16,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 05:20:16,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:16,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 05:20:16,536 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:16,536 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:16,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:16,536 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:16,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:16,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,561 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:16,561 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:16,562 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 05:20:16,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:16,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:16,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:16,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:20:16,727 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:16,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:16,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:16,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:16,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2022-12-06 05:20:16,727 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 05:20:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1506198380, now seen corresponding path program 1 times [2022-12-06 05:20:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:16,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702609840] [2022-12-06 05:20:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:16,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702609840] [2022-12-06 05:20:16,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702609840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:16,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:16,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522401778] [2022-12-06 05:20:16,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:16,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:16,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:16,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:16,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 05:20:16,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:16,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:16,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:17,051 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:17,052 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:17,058 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 05:20:17,066 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:17,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:17,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:17,066 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:17,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:17,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 05:20:17,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,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 05:20:17,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:17,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:17,129 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:17,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:17,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,155 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:17,155 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:20:17,156 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 05:20:17,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:17,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:17,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:20:17,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:17,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 05:20:17,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:17,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 05:20:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2022-12-06 05:20:17,296 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 05:20:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1045958581, now seen corresponding path program 1 times [2022-12-06 05:20:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:17,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851074954] [2022-12-06 05:20:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:17,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 05:20:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:17,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851074954] [2022-12-06 05:20:17,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851074954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:17,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:17,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733558262] [2022-12-06 05:20:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:17,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:17,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:17,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:17,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:17,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 05:20:17,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:17,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:17,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:17,626 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:17,626 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:17,632 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 05:20:17,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:17,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:17,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:17,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 05:20:17,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:17,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 05:20:17,680 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,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 05:20:17,680 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:17,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:17,680 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:17,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:17,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,705 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:17,705 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:17,706 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 05:20:17,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:17,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:17,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:17,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:20:17,852 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:17,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 05:20:17,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:17,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 05:20:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2022-12-06 05:20:17,852 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 05:20:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 696851754, now seen corresponding path program 1 times [2022-12-06 05:20:17,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778705342] [2022-12-06 05:20:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:17,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 05:20:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:17,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778705342] [2022-12-06 05:20:17,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778705342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:17,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:17,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754207334] [2022-12-06 05:20:17,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:17,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:17,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:17,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:17,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:17,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 05:20:17,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:17,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:17,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:18,169 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:18,169 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:18,176 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 05:20:18,183 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:18,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:18,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:18,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 05:20:18,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:18,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 05:20:18,217 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,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 05:20:18,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:18,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:18,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:18,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:18,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,242 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:18,242 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:20:18,243 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 05:20:18,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:18,392 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:18,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:18,392 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:18,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:18,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:18,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 05:20:18,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2022-12-06 05:20:18,393 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 05:20:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1855305207, now seen corresponding path program 1 times [2022-12-06 05:20:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:18,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676306124] [2022-12-06 05:20:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:18,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 05:20:18,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:18,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676306124] [2022-12-06 05:20:18,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676306124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:18,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40229491] [2022-12-06 05:20:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:18,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:18,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:18,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:18,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 05:20:18,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:18,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:18,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:18,725 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:18,725 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:18,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 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 05:20:18,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:18,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:18,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:18,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 05:20:18,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:18,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:18,773 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:18,773 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:18,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:18,773 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:18,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:18,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,797 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:18,798 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:20:18,799 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 05:20:18,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:18,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:18,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:18,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:20:18,957 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:18,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 05:20:18,957 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:18,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 05:20:18,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2022-12-06 05:20:18,957 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 05:20:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash -112494872, now seen corresponding path program 1 times [2022-12-06 05:20:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:18,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31062785] [2022-12-06 05:20:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:19,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 05:20:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:19,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31062785] [2022-12-06 05:20:19,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31062785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:19,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:19,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953350751] [2022-12-06 05:20:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:19,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:19,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:19,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 05:20:19,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:19,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:19,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:19,300 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:19,300 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:19,307 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 05:20:19,314 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:19,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:19,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:19,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 05:20:19,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:19,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:19,347 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:19,347 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:19,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:19,348 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:19,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:19,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,372 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:19,372 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:20:19,373 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 05:20:19,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:19,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:19,519 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:20:19,519 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:19,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:19,519 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:19,519 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:19,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2022-12-06 05:20:19,520 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 05:20:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1630315463, now seen corresponding path program 1 times [2022-12-06 05:20:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:19,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867293539] [2022-12-06 05:20:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:19,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 05:20:19,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:19,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867293539] [2022-12-06 05:20:19,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867293539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:19,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:19,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238811506] [2022-12-06 05:20:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:19,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:19,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:19,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:19,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:19,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 05:20:19,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:19,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:19,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:19,850 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:19,850 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:19,857 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 05:20:19,864 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:19,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:19,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:19,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 05:20:19,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:19,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 05:20:19,896 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,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 05:20:19,896 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:19,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:19,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:19,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:19,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:19,921 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:19,922 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 05:20:19,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:19,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:20,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:20,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:20,071 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:20,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 05:20:20,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:20,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 05:20:20,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2022-12-06 05:20:20,071 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 05:20:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -921841498, now seen corresponding path program 1 times [2022-12-06 05:20:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:20,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107579980] [2022-12-06 05:20:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:20,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 05:20:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107579980] [2022-12-06 05:20:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107579980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:20,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786340540] [2022-12-06 05:20:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:20,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:20,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:20,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:20,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:20,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 05:20:20,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:20,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:20,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:20,521 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:20,521 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:20,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 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 05:20:20,536 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:20,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:20,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:20,537 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:20,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:20,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 05:20:20,571 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:20,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 05:20:20,571 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:20,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:20,571 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:20,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:20,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:20,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:20,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:20,596 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:20,597 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:20,598 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 05:20:20,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:20,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:20,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:20,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:20:20,741 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:20,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 05:20:20,741 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:20,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 05:20:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2022-12-06 05:20:20,741 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 05:20:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash 820968837, now seen corresponding path program 1 times [2022-12-06 05:20:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968781324] [2022-12-06 05:20:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:20,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:20,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968781324] [2022-12-06 05:20:20,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968781324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:20,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:20,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865802569] [2022-12-06 05:20:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:20,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:20,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:20,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 05:20:20,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:20,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:20,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:21,095 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:21,095 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:21,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:21,107 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:21,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:21,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:21,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 05:20:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:21,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 05:20:21,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,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 05:20:21,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:21,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:21,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:21,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:21,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,162 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:21,163 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:21,164 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 05:20:21,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:21,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:21,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:20:21,338 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:21,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 05:20:21,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:21,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 05:20:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2022-12-06 05:20:21,339 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 05:20:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1731188124, now seen corresponding path program 1 times [2022-12-06 05:20:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:21,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813143660] [2022-12-06 05:20:21,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20: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 05:20:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:21,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813143660] [2022-12-06 05:20:21,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813143660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:21,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:21,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350717384] [2022-12-06 05:20:21,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:21,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:21,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20: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 05:20:21,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:21,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:21,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:21,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:21,682 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:21,689 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 05:20:21,697 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:21,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:21,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:21,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 05:20:21,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:21,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:21,731 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:21,732 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:21,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:21,732 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:21,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:21,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,756 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:21,757 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:20:21,758 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 05:20:21,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:21,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:21,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:21,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:20:21,902 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:21,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:21,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:21,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:21,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2022-12-06 05:20:21,902 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 05:20:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 11622211, now seen corresponding path program 1 times [2022-12-06 05:20:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:21,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662197133] [2022-12-06 05:20:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:21,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 05:20:21,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:21,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662197133] [2022-12-06 05:20:21,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662197133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:21,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:21,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964393523] [2022-12-06 05:20:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:21,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:21,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:21,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 05:20:21,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:21,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:21,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:22,226 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:22,226 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:22,233 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 05:20:22,268 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:22,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:22,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:22,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 05:20:22,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:22,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 05:20:22,297 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,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 05:20:22,297 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:22,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:22,297 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,298 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:22,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:22,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,322 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:22,322 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 05:20:22,323 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 05:20:22,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:22,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:22,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:20:22,482 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:22,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:22,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:22,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:22,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2022-12-06 05:20:22,482 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 05:20:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1754432546, now seen corresponding path program 1 times [2022-12-06 05:20:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971889940] [2022-12-06 05:20:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:22,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:22,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971889940] [2022-12-06 05:20:22,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971889940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:22,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:22,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:22,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265989582] [2022-12-06 05:20:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:22,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:22,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 05:20:22,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:22,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:22,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:22,827 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:22,827 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:22,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 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 05:20:22,841 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:22,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:22,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:22,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 05:20:22,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:22,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 05:20:22,874 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,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 05:20:22,874 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:22,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:22,874 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:22,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:22,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,899 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:22,899 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:20:22,900 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 05:20:22,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:22,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:23,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:23,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:20:23,042 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:23,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:23,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:23,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:23,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2022-12-06 05:20:23,042 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 05:20:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash -797724415, now seen corresponding path program 1 times [2022-12-06 05:20:23,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:23,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336421700] [2022-12-06 05:20:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:23,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 05:20:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:23,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336421700] [2022-12-06 05:20:23,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336421700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:23,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:23,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785347169] [2022-12-06 05:20:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:23,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:23,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:23,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 05:20:23,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:23,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:23,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:23,389 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:23,389 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:23,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 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 05:20:23,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:23,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:23,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:23,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 05:20:23,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:23,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:23,437 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:23,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 05:20:23,437 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:23,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:23,437 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:23,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:23,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:23,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:23,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:23,461 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:23,462 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:23,463 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 05:20:23,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:23,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:23,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:23,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:20:23,629 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:23,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 05:20:23,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:23,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 05:20:23,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2022-12-06 05:20:23,629 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 05:20:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 945085920, now seen corresponding path program 1 times [2022-12-06 05:20:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:23,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167183746] [2022-12-06 05:20:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:23,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 05:20:23,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:23,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167183746] [2022-12-06 05:20:23,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167183746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:23,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:23,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980825429] [2022-12-06 05:20:23,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:23,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:23,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:23,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:23,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:23,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:23,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 05:20:23,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:23,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:23,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:23,971 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:23,971 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:23,978 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 05:20:23,985 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:23,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:23,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:23,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 05:20:23,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:24,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:24,018 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:24,018 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:24,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:24,018 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:24,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:24,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,044 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:24,044 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:20:24,045 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 05:20:24,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:24,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:24,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:20:24,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:24,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 05:20:24,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:24,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 05:20:24,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2022-12-06 05:20:24,203 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 05:20:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1607071041, now seen corresponding path program 1 times [2022-12-06 05:20:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336538264] [2022-12-06 05:20:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:24,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336538264] [2022-12-06 05:20:24,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336538264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:24,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:24,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862475655] [2022-12-06 05:20:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:24,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:24,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:24,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:24,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:24,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:24,541 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:24,541 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:24,548 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 05:20:24,555 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:24,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:24,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:24,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 05:20:24,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:24,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 05:20:24,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,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 05:20:24,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:24,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:24,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:24,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:24,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,616 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:24,616 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:24,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 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 05:20:24,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:24,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:24,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:24,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:20:24,758 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:24,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 05:20:24,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:24,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 05:20:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2022-12-06 05:20:24,758 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 05:20:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash 135739294, now seen corresponding path program 1 times [2022-12-06 05:20:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70169687] [2022-12-06 05:20:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:24,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 05:20:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:24,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70169687] [2022-12-06 05:20:24,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70169687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:24,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:24,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464685612] [2022-12-06 05:20:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:24,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:24,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:24,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:24,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:24,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:24,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 05:20:24,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:24,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:24,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:25,115 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:25,115 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:25,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 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 05:20:25,130 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:25,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:25,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:25,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 05:20:25,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:25,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:25,163 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:25,163 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:25,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:25,163 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:25,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:25,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,188 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:25,188 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:20:25,189 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 05:20:25,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:25,345 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:25,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:20:25,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:25,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 05:20:25,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20: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 05:20:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2022-12-06 05:20:25,346 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 05:20:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1878549629, now seen corresponding path program 1 times [2022-12-06 05:20:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:25,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039256901] [2022-12-06 05:20:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039256901] [2022-12-06 05:20:25,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039256901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:25,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:25,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972330947] [2022-12-06 05:20:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:25,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:25,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:25,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:25,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:25,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:25,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:25,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:25,684 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:25,691 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 05:20:25,698 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:25,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:25,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:25,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 05:20:25,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:25,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 05:20:25,738 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,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 05:20:25,739 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:25,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:25,739 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:25,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:25,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,764 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:25,764 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:25,765 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 05:20:25,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:25,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:25,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:25,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:20:25,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:25,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 05:20:25,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:25,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 05:20:25,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2022-12-06 05:20:25,936 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 05:20:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -673607332, now seen corresponding path program 1 times [2022-12-06 05:20:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:25,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624682261] [2022-12-06 05:20:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:26,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 05:20:26,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:26,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624682261] [2022-12-06 05:20:26,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624682261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:26,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:26,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690241255] [2022-12-06 05:20:26,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:26,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:26,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:26,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:26,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 05:20:26,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:26,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:26,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:26,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:26,290 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:26,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 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 05:20:26,303 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:26,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:26,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:26,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 05:20:26,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:26,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 05:20:26,334 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,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 05:20:26,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:26,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:26,334 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:26,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:26,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,359 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:26,359 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:20:26,360 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 05:20:26,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:26,512 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:26,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:20:26,513 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:26,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 05:20:26,513 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:26,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 05:20:26,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2022-12-06 05:20:26,513 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 05:20:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1069203003, now seen corresponding path program 1 times [2022-12-06 05:20:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:26,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231573158] [2022-12-06 05:20:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:26,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 05:20:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231573158] [2022-12-06 05:20:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231573158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212046577] [2022-12-06 05:20:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:26,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:26,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:26,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 05:20:26,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:26,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:26,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:26,839 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:26,840 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:20:26,846 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 05:20:26,854 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:26,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:26,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20: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 05:20:26,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:26,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 05:20:26,888 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,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 05:20:26,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:26,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:26,889 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:26,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:26,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,914 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:26,914 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:26,915 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 05:20:26,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:26,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:27,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:27,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:27,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:27,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 05:20:27,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:27,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 05:20:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2022-12-06 05:20:27,064 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 05:20:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1482953958, now seen corresponding path program 1 times [2022-12-06 05:20:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454826376] [2022-12-06 05:20:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:27,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 05:20:27,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454826376] [2022-12-06 05:20:27,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454826376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:27,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:27,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824330939] [2022-12-06 05:20:27,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:27,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:27,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:27,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 05:20:27,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:27,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:27,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:27,429 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:27,429 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:27,435 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 05:20:27,440 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:27,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:27,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:27,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 05:20:27,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:27,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 05:20:27,470 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:27,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 05:20:27,470 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:27,471 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:27,471 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:27,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:27,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:27,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:27,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:27,496 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:27,496 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:27,497 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 05:20:27,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:27,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:27,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:27,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:20:27,651 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:27,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 05:20:27,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:27,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 05:20:27,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2022-12-06 05:20:27,651 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 05:20:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 259856377, now seen corresponding path program 1 times [2022-12-06 05:20:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:27,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114829881] [2022-12-06 05:20:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:27,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:27,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 05:20:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:27,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114829881] [2022-12-06 05:20:27,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114829881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:27,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:27,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460882891] [2022-12-06 05:20:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:27,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:27,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:27,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:27,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 05:20:27,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:27,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:27,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:27,993 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:27,993 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:28,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:28,007 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:28,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:28,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:28,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 05:20:28,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:28,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 05:20:28,039 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,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 05:20:28,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:28,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:28,040 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:28,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:28,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,065 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:28,065 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:20:28,066 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 05:20:28,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:28,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:28,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:28,215 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:28,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 05:20:28,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:28,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 05:20:28,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2022-12-06 05:20:28,215 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 05:20:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:28,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2002666712, now seen corresponding path program 1 times [2022-12-06 05:20:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560509745] [2022-12-06 05:20:28,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:28,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 05:20:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:28,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560509745] [2022-12-06 05:20:28,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560509745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:28,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:28,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330963056] [2022-12-06 05:20:28,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:28,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:28,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:28,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 05:20:28,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:28,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:28,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:28,558 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:28,558 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:28,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 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 05:20:28,573 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:28,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:28,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:28,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 05:20:28,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:28,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 05:20:28,608 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,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 05:20:28,609 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:28,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:28,609 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,609 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:28,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:28,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,641 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:28,641 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:20:28,642 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 05:20:28,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:28,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:28,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:28,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:20:28,789 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:28,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:28,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:28,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2022-12-06 05:20:28,789 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 05:20:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash -549490249, now seen corresponding path program 1 times [2022-12-06 05:20:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793499906] [2022-12-06 05:20:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:28,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793499906] [2022-12-06 05:20:28,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793499906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:28,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:28,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271753648] [2022-12-06 05:20:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:28,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:28,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:28,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 05:20:28,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:28,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:28,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:29,114 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:29,114 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:29,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:29,129 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:29,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:29,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:29,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 05:20:29,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:29,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 05:20:29,163 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:29,163 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:29,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:29,163 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:29,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:29,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,188 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:29,188 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:20:29,189 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 05:20:29,191 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:29,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:29,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:20:29,341 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:29,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:29,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:29,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:29,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2022-12-06 05:20:29,341 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 05:20:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1193320086, now seen corresponding path program 1 times [2022-12-06 05:20:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:29,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538487686] [2022-12-06 05:20:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:29,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538487686] [2022-12-06 05:20:29,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538487686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:29,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:29,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468628140] [2022-12-06 05:20:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:29,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:29,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:29,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 05:20:29,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:29,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:29,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:29,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:29,666 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:29,673 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 05:20:29,681 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:29,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:29,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:29,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 05:20:29,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:29,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 05:20:29,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,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 05:20:29,714 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:29,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:29,715 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:29,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:29,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,739 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:29,739 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:20:29,740 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 05:20:29,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:29,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:29,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:29,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:20:29,878 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:29,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:29,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:29,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:29,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2022-12-06 05:20:29,878 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 05:20:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1358836875, now seen corresponding path program 1 times [2022-12-06 05:20:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:29,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185085383] [2022-12-06 05:20:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:29,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:29,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185085383] [2022-12-06 05:20:29,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185085383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:29,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:29,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396611405] [2022-12-06 05:20:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:29,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:29,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:29,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 05:20:29,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:29,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:29,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:30,216 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:30,216 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:30,223 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 05:20:30,231 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:30,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:30,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:30,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 05:20:30,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:30,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 05:20:30,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,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 05:20:30,263 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:30,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:30,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:30,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:30,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,287 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:30,288 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:20:30,289 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 05:20:30,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:30,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:30,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:20:30,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:30,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 05:20:30,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:30,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 05:20:30,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2022-12-06 05:20:30,435 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 05:20:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 383973460, now seen corresponding path program 1 times [2022-12-06 05:20:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:30,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923245217] [2022-12-06 05:20:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:30,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 05:20:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923245217] [2022-12-06 05:20:30,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923245217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:30,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:30,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190562122] [2022-12-06 05:20:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:30,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:30,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:30,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:30,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 05:20:30,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:30,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:30,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:30,764 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:30,764 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:30,771 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 05:20:30,778 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:30,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:30,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:30,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 05:20:30,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:30,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 05:20:30,810 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,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 05:20:30,810 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:30,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:30,810 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:30,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:30,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,835 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:30,835 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:20:30,836 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 05:20:30,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:30,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:30,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:30,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:20:30,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:30,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 05:20:30,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:30,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 05:20:30,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2022-12-06 05:20:30,998 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 05:20:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2126783795, now seen corresponding path program 1 times [2022-12-06 05:20:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:30,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831145767] [2022-12-06 05:20:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:31,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831145767] [2022-12-06 05:20:31,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831145767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:31,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:31,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:31,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034087430] [2022-12-06 05:20:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:31,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:31,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:31,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 05:20:31,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:31,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:31,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:31,353 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:31,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 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 05:20:31,367 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:31,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:31,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:31,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 05:20:31,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:31,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 05:20:31,399 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:31,399 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:31,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:31,399 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:31,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:31,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,424 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:31,424 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:20:31,425 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 05:20:31,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:31,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:31,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:31,573 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:31,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:31,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2022-12-06 05:20:31,573 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 05:20:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash -425373166, now seen corresponding path program 1 times [2022-12-06 05:20:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505735881] [2022-12-06 05:20:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:31,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505735881] [2022-12-06 05:20:31,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505735881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:31,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:31,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:31,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498797119] [2022-12-06 05:20:31,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:31,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:31,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:31,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:31,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:31,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:31,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:31,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:31,926 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:31,926 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:31,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 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 05:20:31,942 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:31,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:31,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:31,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 05:20:31,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:31,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:31,977 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:31,978 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:31,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:31,978 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:31,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:31,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:31,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,003 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:32,003 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:20:32,004 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 05:20:32,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:32,147 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:32,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:20:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:32,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 05:20:32,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:32,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 05:20:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2022-12-06 05:20:32,148 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 05:20:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1317437169, now seen corresponding path program 1 times [2022-12-06 05:20:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:32,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724686240] [2022-12-06 05:20:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:32,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:32,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724686240] [2022-12-06 05:20:32,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724686240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:32,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:32,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26014229] [2022-12-06 05:20:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:32,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:32,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:32,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:32,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:32,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:32,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:32,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:32,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:32,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:32,500 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:32,501 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:32,507 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 05:20:32,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:32,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:32,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:32,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 05:20:32,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:32,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 05:20:32,541 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,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 05:20:32,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:32,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:32,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:32,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:32,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,567 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:32,567 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:32,568 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 05:20:32,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:32,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:32,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:32,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:32,716 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:32,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 05:20:32,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:32,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 05:20:32,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2022-12-06 05:20:32,717 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 05:20:32,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1234719792, now seen corresponding path program 1 times [2022-12-06 05:20:32,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:32,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370296748] [2022-12-06 05:20:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:32,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 05:20:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:32,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370296748] [2022-12-06 05:20:32,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370296748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:32,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:32,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195176248] [2022-12-06 05:20:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:32,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:32,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:32,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 05:20:32,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:32,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:32,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:33,040 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:33,040 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:33,048 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 05:20:33,055 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:33,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:33,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:33,056 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:33,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:33,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 05:20:33,091 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:33,091 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:33,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:33,091 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:33,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:33,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,116 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:33,117 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:20:33,117 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 05:20:33,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:33,276 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:33,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:20:33,277 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:33,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:33,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:33,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:33,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2022-12-06 05:20:33,277 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 05:20:33,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash 508090543, now seen corresponding path program 1 times [2022-12-06 05:20:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:33,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528070683] [2022-12-06 05:20:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:33,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528070683] [2022-12-06 05:20:33,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528070683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:33,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:33,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474949164] [2022-12-06 05:20:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:33,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:33,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:33,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:33,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:33,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:33,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:33,617 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:33,617 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:20:33,624 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 05:20:33,631 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:33,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:33,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:33,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 05:20:33,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:33,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 05:20:33,663 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,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 05:20:33,663 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:33,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:33,663 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:33,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:33,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,695 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:33,695 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:20:33,696 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 05:20:33,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:33,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:33,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:33,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:20:33,835 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:33,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:33,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:33,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 05:20:33,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2022-12-06 05:20:33,835 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 05:20:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2044066418, now seen corresponding path program 1 times [2022-12-06 05:20:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:33,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831647544] [2022-12-06 05:20:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:33,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 05:20:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:33,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831647544] [2022-12-06 05:20:33,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831647544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:33,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:33,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630554775] [2022-12-06 05:20:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:33,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:33,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:33,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:33,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 05:20:33,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:33,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:33,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:34,176 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:34,176 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:34,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 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 05:20:34,191 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:34,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:34,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:34,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 05:20:34,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:34,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 05:20:34,225 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:34,225 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:34,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:34,225 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:34,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:34,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,250 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:34,250 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:20:34,251 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 05:20:34,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:34,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:34,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:34,400 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:34,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 05:20:34,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:34,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 05:20:34,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2022-12-06 05:20:34,400 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 05:20:34,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash -301256083, now seen corresponding path program 1 times [2022-12-06 05:20:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:34,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980231114] [2022-12-06 05:20:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:34,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 05:20:34,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:34,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980231114] [2022-12-06 05:20:34,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980231114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:34,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:34,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393232976] [2022-12-06 05:20:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:34,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:34,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:34,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:34,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 05:20:34,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:34,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:34,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:34,723 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:34,723 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:34,729 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 05:20:34,737 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:34,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:34,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:34,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 05:20:34,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:34,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 05:20:34,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,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 05:20:34,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:34,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:34,771 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:34,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:34,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,796 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:34,796 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:34,797 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 05:20:34,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:34,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:34,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:34,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:20:34,941 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:34,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 05:20:34,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:34,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 05:20:34,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2022-12-06 05:20:34,941 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 05:20:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:34,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1441554252, now seen corresponding path program 1 times [2022-12-06 05:20:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:34,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916286512] [2022-12-06 05:20:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:34,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916286512] [2022-12-06 05:20:35,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916286512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:35,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:35,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881719827] [2022-12-06 05:20:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:35,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:35,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:35,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:35,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 05:20:35,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:35,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:35,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:35,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:35,293 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:35,300 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 05:20:35,308 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:35,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:35,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:35,308 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:35,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:35,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 05:20:35,342 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,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 05:20:35,342 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:35,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:35,342 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:35,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:35,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,367 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:35,367 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:20:35,368 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 05:20:35,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:35,520 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:35,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:20:35,520 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:35,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:35,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:35,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:35,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2022-12-06 05:20:35,521 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 05:20:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1110602709, now seen corresponding path program 1 times [2022-12-06 05:20:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:35,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076729281] [2022-12-06 05:20:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:35,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 05:20:35,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076729281] [2022-12-06 05:20:35,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076729281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:35,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:35,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908959524] [2022-12-06 05:20:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:35,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:35,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:35,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:35,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 05:20:35,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:35,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:35,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:35,866 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:35,866 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:35,876 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 05:20:35,887 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:35,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:35,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:35,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 05:20:35,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:35,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:35,931 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:35,932 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:35,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:35,932 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:35,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:35,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,965 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:35,965 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:35,966 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 05:20:35,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:35,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:36,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:36,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:20:36,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:36,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 05:20:36,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:36,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 05:20:36,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2022-12-06 05:20:36,131 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 05:20:36,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash 632207626, now seen corresponding path program 1 times [2022-12-06 05:20:36,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:36,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251219719] [2022-12-06 05:20:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:36,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 05:20:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:36,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251219719] [2022-12-06 05:20:36,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251219719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:36,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:36,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946683064] [2022-12-06 05:20:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:36,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:36,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:36,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 05:20:36,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:36,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:36,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:36,484 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:36,484 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:36,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:36,497 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:36,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:36,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:36,500 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:36,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:36,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 05:20:36,543 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:36,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 05:20:36,543 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:36,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:36,543 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:36,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:36,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:36,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:36,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:36,579 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:36,579 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:20:36,581 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 05:20:36,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:36,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:36,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:36,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:20:36,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:36,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 05:20:36,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:36,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 05:20:36,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2022-12-06 05:20:36,744 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 05:20:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1919949335, now seen corresponding path program 1 times [2022-12-06 05:20:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:36,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205102754] [2022-12-06 05:20:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:36,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 05:20:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:36,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205102754] [2022-12-06 05:20:36,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205102754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:36,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:36,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:36,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191684684] [2022-12-06 05:20:36,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:36,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:36,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:36,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:36,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:36,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 05:20:36,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:36,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:37,096 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:37,096 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:37,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 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 05:20:37,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:37,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:37,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:37,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 05:20:37,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:37,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 05:20:37,146 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,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 05:20:37,146 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:37,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:37,146 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:37,147 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:37,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,172 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:37,172 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:37,173 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 05:20:37,175 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,175 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:37,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:37,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:20:37,351 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:37,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:37,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:37,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:37,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2022-12-06 05:20:37,351 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 05:20:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash -177139000, now seen corresponding path program 1 times [2022-12-06 05:20:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829579951] [2022-12-06 05:20:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:37,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 05:20:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:37,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829579951] [2022-12-06 05:20:37,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829579951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:37,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:37,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39650374] [2022-12-06 05:20:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:37,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:37,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 05:20:37,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:37,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:37,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:37,799 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:37,800 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:20:37,806 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 05:20:37,812 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:37,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:37,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20: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 05:20:37,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:37,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 05:20:37,839 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,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 05:20:37,839 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:37,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:37,839 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,840 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:37,840 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:37,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,864 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:37,864 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 05:20:37,865 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 05:20:37,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:37,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:38,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:38,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:20:38,032 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:38,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:38,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:38,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:38,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2022-12-06 05:20:38,032 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 05:20:38,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1565671335, now seen corresponding path program 1 times [2022-12-06 05:20:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:38,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636860701] [2022-12-06 05:20:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:38,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:38,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636860701] [2022-12-06 05:20:38,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636860701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:38,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:38,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567455827] [2022-12-06 05:20:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:38,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:38,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:38,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:38,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:38,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:38,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:38,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:38,385 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:38,385 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:38,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:38,400 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:38,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:38,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:38,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 05:20:38,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:38,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 05:20:38,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:38,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 05:20:38,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:38,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:38,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:38,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:38,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:38,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:38,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:38,458 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:38,458 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:20:38,459 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 05:20:38,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:38,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:38,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:38,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:20:38,616 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:38,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:38,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:38,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 05:20:38,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2022-12-06 05:20:38,616 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 05:20:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash -986485626, now seen corresponding path program 1 times [2022-12-06 05:20:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:38,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562994531] [2022-12-06 05:20:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:38,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 05:20:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:38,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562994531] [2022-12-06 05:20:38,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562994531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:38,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:38,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437459649] [2022-12-06 05:20:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:38,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:38,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:38,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 05:20:38,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:38,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:38,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:38,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:38,946 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:38,953 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 05:20:38,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:38,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:38,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:38,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 05:20:38,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:39,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 05:20:39,021 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:39,021 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:39,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:39,021 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:39,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:39,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,046 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:39,046 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:39,047 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 05:20:39,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:39,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:39,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:20:39,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:39,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:39,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:39,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:39,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2022-12-06 05:20:39,199 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 05:20:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 756324709, now seen corresponding path program 1 times [2022-12-06 05:20:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:39,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925785757] [2022-12-06 05:20:39,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:39,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925785757] [2022-12-06 05:20:39,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925785757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:39,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:39,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995401638] [2022-12-06 05:20:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:39,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:39,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:39,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 05:20:39,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:39,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:39,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:39,530 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:39,530 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:39,537 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 05:20:39,545 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:39,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:39,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:39,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 05:20:39,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:39,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 05:20:39,579 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,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 05:20:39,580 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:39,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:39,580 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:39,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:39,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,605 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:39,605 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:39,606 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 05:20:39,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:39,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:39,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:39,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:20:39,762 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:39,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 05:20:39,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:39,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 05:20:39,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2022-12-06 05:20:39,762 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 05:20:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1795832252, now seen corresponding path program 1 times [2022-12-06 05:20:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:39,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618404820] [2022-12-06 05:20:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:39,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618404820] [2022-12-06 05:20:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618404820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:39,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:39,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940551196] [2022-12-06 05:20:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:39,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:39,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:39,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:39,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:39,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:39,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:40,089 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:40,090 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:40,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:40,105 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:40,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:40,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:40,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 05:20:40,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:40,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:40,138 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:40,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:40,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:40,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:40,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:40,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,164 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:40,165 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:20:40,166 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 05:20:40,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:40,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:40,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:20:40,329 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:40,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:40,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:40,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:40,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2022-12-06 05:20:40,330 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 05:20:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash -53021917, now seen corresponding path program 1 times [2022-12-06 05:20:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:40,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607255097] [2022-12-06 05:20:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607255097] [2022-12-06 05:20:40,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607255097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:40,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:40,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32383955] [2022-12-06 05:20:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:40,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:40,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:40,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 05:20:40,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:40,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:40,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:40,663 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:40,663 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:40,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:40,678 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:40,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:40,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:40,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 05:20:40,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:40,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 05:20:40,712 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,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 05:20:40,712 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:40,712 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:40,712 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,712 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:40,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:40,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,737 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:40,737 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:20:40,738 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 05:20:40,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:40,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:40,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:40,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:20:40,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:40,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 05:20:40,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:40,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 05:20:40,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2022-12-06 05:20:40,882 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 05:20:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1689788418, now seen corresponding path program 1 times [2022-12-06 05:20:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:40,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089473178] [2022-12-06 05:20:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:40,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 05:20:40,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:40,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089473178] [2022-12-06 05:20:40,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089473178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:40,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:40,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893229351] [2022-12-06 05:20:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:40,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:40,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:40,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20: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 05:20:40,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:40,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:40,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:41,209 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:41,209 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:41,216 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 05:20:41,224 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:41,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:41,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:41,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 05:20:41,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:41,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 05:20:41,256 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,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 05:20:41,256 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:41,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:41,256 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:41,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:41,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,281 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:41,281 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:20:41,283 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 05:20:41,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:41,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:41,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:20:41,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:41,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 05:20:41,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:41,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 05:20:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2022-12-06 05:20:41,421 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 05:20:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -862368543, now seen corresponding path program 1 times [2022-12-06 05:20:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:41,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067214223] [2022-12-06 05:20:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:41,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 05:20:41,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:41,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067214223] [2022-12-06 05:20:41,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067214223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:41,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:41,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275725423] [2022-12-06 05:20:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:41,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:41,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 05:20:41,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:41,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:41,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:41,796 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:41,803 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 05:20:41,810 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:41,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:41,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:41,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:41,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:41,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 05:20:41,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,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 05:20:41,844 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:41,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:41,844 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:41,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:41,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,869 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:41,869 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:41,870 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 05:20:41,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:41,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:42,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:42,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:20:42,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:42,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 05:20:42,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:42,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 05:20:42,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2022-12-06 05:20:42,023 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 05:20:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 880441792, now seen corresponding path program 1 times [2022-12-06 05:20:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:42,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95758447] [2022-12-06 05:20:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:42,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95758447] [2022-12-06 05:20:42,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95758447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:42,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:42,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909480480] [2022-12-06 05:20:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:42,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:42,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:42,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 05:20:42,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:42,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:42,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:42,387 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:42,387 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:42,394 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 05:20:42,401 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:42,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:42,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:42,402 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:42,434 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:42,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:42,435 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:42,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:42,435 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:42,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:42,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:42,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:42,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:42,460 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:42,460 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:20:42,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 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 05:20:42,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:42,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:42,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:42,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:20:42,616 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:42,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:42,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:42,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 05:20:42,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2022-12-06 05:20:42,616 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 05:20:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1671715169, now seen corresponding path program 1 times [2022-12-06 05:20:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897873680] [2022-12-06 05:20:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:42,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 05:20:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897873680] [2022-12-06 05:20:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897873680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094503434] [2022-12-06 05:20:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:42,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:42,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:42,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 05:20:42,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:42,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:42,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:42,970 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:42,970 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:42,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:42,983 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:42,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:42,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:42,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 05:20:42,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:43,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 05:20:43,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,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 05:20:43,015 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:43,015 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:43,015 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:43,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:43,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,040 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:43,040 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:20:43,041 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 05:20:43,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:43,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:43,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:20:43,205 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:43,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 05:20:43,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:43,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:43,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2022-12-06 05:20:43,206 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 05:20:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash 71095166, now seen corresponding path program 1 times [2022-12-06 05:20:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:43,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009899639] [2022-12-06 05:20:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:43,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009899639] [2022-12-06 05:20:43,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009899639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:43,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:43,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:43,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089294757] [2022-12-06 05:20:43,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:43,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:43,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:43,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:43,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:43,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:43,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:43,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:43,557 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:43,558 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:20:43,565 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 05:20:43,573 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:43,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:43,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:43,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 05:20:43,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:43,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 05:20:43,606 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,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 05:20:43,606 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:43,606 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:43,606 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,607 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:43,607 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:43,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,631 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:43,631 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:43,632 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 05:20:43,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:43,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:43,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:43,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:20:43,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:43,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:43,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:43,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2022-12-06 05:20:43,777 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 05:20:43,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1813905501, now seen corresponding path program 1 times [2022-12-06 05:20:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857008414] [2022-12-06 05:20:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:43,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:43,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857008414] [2022-12-06 05:20:43,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857008414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:43,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:43,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336942851] [2022-12-06 05:20:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:43,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:43,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:43,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 05:20:43,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:43,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:43,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:44,141 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:44,141 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:20:44,147 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 05:20:44,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:44,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:44,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:44,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 05:20:44,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:44,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:44,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:44,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:44,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:44,182 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:44,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:44,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,206 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:44,206 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:20:44,207 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 05:20:44,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:44,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:44,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:20:44,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:44,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 05:20:44,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:44,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 05:20:44,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2022-12-06 05:20:44,368 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 05:20:44,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -738251460, now seen corresponding path program 1 times [2022-12-06 05:20:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:44,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022998539] [2022-12-06 05:20:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:44,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 05:20:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022998539] [2022-12-06 05:20:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022998539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351606828] [2022-12-06 05:20:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:44,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:44,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:44,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 05:20:44,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:44,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:44,715 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:44,716 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:44,723 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 05:20:44,730 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:44,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:44,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:44,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 05:20:44,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:44,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 05:20:44,763 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,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 05:20:44,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:44,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:44,763 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:44,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:44,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,788 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:44,788 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:20:44,789 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 05:20:44,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:44,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:44,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:44,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:20:44,932 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:44,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 05:20:44,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:44,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 05:20:44,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2022-12-06 05:20:44,933 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 05:20:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1004558875, now seen corresponding path program 1 times [2022-12-06 05:20:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:44,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913259491] [2022-12-06 05:20:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:45,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 05:20:45,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:45,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913259491] [2022-12-06 05:20:45,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913259491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:45,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:45,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755538545] [2022-12-06 05:20:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:45,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:45,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:45,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 05:20:45,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:45,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:45,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:45,281 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:45,281 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:45,288 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 05:20:45,296 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:45,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:45,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:45,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 05:20:45,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:45,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 05:20:45,329 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:45,329 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:45,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:45,329 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:45,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:45,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,362 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:45,362 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:20:45,363 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 05:20:45,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:45,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:45,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:20:45,520 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:45,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:45,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:45,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:45,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2022-12-06 05:20:45,520 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 05:20:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1547598086, now seen corresponding path program 1 times [2022-12-06 05:20:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:45,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087387283] [2022-12-06 05:20:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:45,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 05:20:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:45,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087387283] [2022-12-06 05:20:45,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087387283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:45,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:45,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822437709] [2022-12-06 05:20:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:45,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:45,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:45,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:45,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:45,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:45,849 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:45,849 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:45,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:45,863 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:45,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:45,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:45,864 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:45,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:45,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:45,899 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,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 05:20:45,899 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:45,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:45,900 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:45,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:45,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,925 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:45,925 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:20:45,926 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 05:20:45,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:45,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:46,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:46,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:20:46,082 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:46,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 05:20:46,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:46,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 05:20:46,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2022-12-06 05:20:46,082 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 05:20:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 195212249, now seen corresponding path program 1 times [2022-12-06 05:20:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127627409] [2022-12-06 05:20:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:46,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 05:20:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:46,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127627409] [2022-12-06 05:20:46,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127627409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:46,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:46,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:46,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993661443] [2022-12-06 05:20:46,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:46,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:46,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:46,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:46,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 05:20:46,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:46,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:46,411 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:46,411 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:46,418 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 05:20:46,425 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:46,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:46,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:46,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 05:20:46,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:46,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:46,460 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20: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 05:20:46,461 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:46,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:46,461 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:46,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:46,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:46,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:46,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:46,492 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:46,492 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:20:46,493 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 05:20:46,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:46,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:46,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:46,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:20:46,648 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:46,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 05:20:46,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:46,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 05:20:46,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2022-12-06 05:20:46,648 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 05:20:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1938022584, now seen corresponding path program 1 times [2022-12-06 05:20:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:46,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924557578] [2022-12-06 05:20:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20: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 05:20:46,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:46,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924557578] [2022-12-06 05:20:46,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924557578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:46,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:46,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519859539] [2022-12-06 05:20:46,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:46,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:46,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20: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 05:20:46,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:46,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:47,001 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:47,001 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:47,008 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 05:20:47,016 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:47,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:47,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:47,017 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:47,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:47,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 05:20:47,047 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,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 05:20:47,048 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:47,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:47,048 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,048 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:47,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:47,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,073 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:47,073 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:20:47,074 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 05:20:47,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:47,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:47,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:20:47,220 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:47,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 05:20:47,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:47,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 05:20:47,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2022-12-06 05:20:47,220 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 05:20:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash -614134377, now seen corresponding path program 1 times [2022-12-06 05:20:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:47,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436633667] [2022-12-06 05:20:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:47,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 05:20:47,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:47,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436633667] [2022-12-06 05:20:47,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436633667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:47,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:47,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681051364] [2022-12-06 05:20:47,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:47,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:47,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 05:20:47,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:47,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:47,573 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:47,574 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:47,581 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 05:20:47,588 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:47,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:47,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:47,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:47,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 05:20:47,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:47,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 05:20:47,623 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:47,623 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:47,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:47,623 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:47,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:47,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,649 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:47,649 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:47,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 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 05:20:47,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:47,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:47,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:47,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:20:47,799 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:47,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:47,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:47,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:47,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2022-12-06 05:20:47,799 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 05:20:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1128675958, now seen corresponding path program 1 times [2022-12-06 05:20:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:47,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172898306] [2022-12-06 05:20:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:47,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 05:20:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:47,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172898306] [2022-12-06 05:20:47,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172898306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:47,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:47,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216928856] [2022-12-06 05:20:47,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:47,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:47,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:47,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 05:20:47,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:47,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:47,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:48,130 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:48,130 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:48,137 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 05:20:48,143 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:48,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:48,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:48,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:48,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:48,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 05:20:48,178 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,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 05:20:48,178 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:48,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:48,178 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:48,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:48,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,203 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:48,204 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:48,205 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 05:20:48,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:48,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:48,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:20:48,364 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:48,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 05:20:48,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:48,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 05:20:48,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2022-12-06 05:20:48,364 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 05:20:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1423481003, now seen corresponding path program 1 times [2022-12-06 05:20:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:48,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683600109] [2022-12-06 05:20:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:48,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 05:20:48,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:48,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683600109] [2022-12-06 05:20:48,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683600109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:48,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:48,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430061540] [2022-12-06 05:20:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:48,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:48,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:48,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:48,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 05:20:48,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:48,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:48,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:48,687 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:48,687 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:48,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:48,701 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:48,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:48,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:48,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 05:20:48,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:48,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 05:20:48,734 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,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 05:20:48,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:48,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:48,734 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:48,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:48,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,759 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:48,759 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:20:48,760 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 05:20:48,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:48,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:48,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:48,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:20:48,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:48,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 05:20:48,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:48,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 05:20:48,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2022-12-06 05:20:48,913 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 05:20:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash 319329332, now seen corresponding path program 1 times [2022-12-06 05:20:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:48,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927789616] [2022-12-06 05:20:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:48,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927789616] [2022-12-06 05:20:48,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927789616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:48,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:48,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:48,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829334683] [2022-12-06 05:20:48,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:48,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:48,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:48,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:48,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 05:20:48,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:48,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:48,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:49,282 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:49,282 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:49,288 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 05:20:49,294 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:49,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:49,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:49,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 05:20:49,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:49,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 05:20:49,325 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:49,325 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:49,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:49,325 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:49,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:49,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,350 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:49,350 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:20:49,351 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 05:20:49,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:49,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:49,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:20:49,518 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:49,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:49,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:49,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2022-12-06 05:20:49,518 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 05:20:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2062139667, now seen corresponding path program 1 times [2022-12-06 05:20:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:49,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805805333] [2022-12-06 05:20:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805805333] [2022-12-06 05:20:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805805333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:49,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:49,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471786389] [2022-12-06 05:20:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:49,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:49,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:49,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 05:20:49,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:49,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:49,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:49,846 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:49,846 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:49,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:49,860 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:49,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:49,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:49,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 05:20:49,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:49,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 05:20:49,895 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,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 05:20:49,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:49,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:49,895 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:49,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:49,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,920 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:49,920 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:20:49,921 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 05:20:49,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:49,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:50,068 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:50,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:20:50,069 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:50,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 05:20:50,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:50,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 05:20:50,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2022-12-06 05:20:50,069 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 05:20:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -490017294, now seen corresponding path program 1 times [2022-12-06 05:20:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:50,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041446643] [2022-12-06 05:20:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041446643] [2022-12-06 05:20:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041446643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:50,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:50,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055265310] [2022-12-06 05:20:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:50,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:50,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:50,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:50,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:50,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:50,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:50,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:50,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:50,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:50,423 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:20:50,430 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 05:20:50,438 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:50,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:50,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:50,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 05:20:50,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:50,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 05:20:50,471 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:50,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 05:20:50,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:50,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:50,472 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:50,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:50,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:50,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:50,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:50,503 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:50,503 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:20:50,504 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 05:20:50,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:50,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:50,650 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:50,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:20:50,651 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:50,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 05:20:50,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:50,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 05:20:50,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2022-12-06 05:20:50,651 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 05:20:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1252793041, now seen corresponding path program 1 times [2022-12-06 05:20:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812474455] [2022-12-06 05:20:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:50,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 05:20:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:50,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812474455] [2022-12-06 05:20:50,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812474455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:50,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:50,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:50,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758609130] [2022-12-06 05:20:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:50,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:50,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:50,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:50,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 05:20:50,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:50,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:50,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:51,003 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:51,003 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:51,011 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 05:20:51,019 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:51,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:51,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:51,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:51,020 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:51,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:51,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:51,053 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,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 05:20:51,054 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:51,054 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:51,054 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:51,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:51,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,078 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:51,079 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:51,080 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 05:20:51,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:51,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:51,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:20:51,221 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:51,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 05:20:51,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:51,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 05:20:51,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2022-12-06 05:20:51,222 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 05:20:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1299363920, now seen corresponding path program 1 times [2022-12-06 05:20:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:51,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948296567] [2022-12-06 05:20:51,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:51,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 05:20:51,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:51,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948296567] [2022-12-06 05:20:51,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948296567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:51,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:51,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514873448] [2022-12-06 05:20:51,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:51,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:51,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:51,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:51,281 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:51,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:51,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:51,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:51,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:51,549 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:51,549 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:51,557 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 05:20:51,565 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:51,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:51,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:51,566 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:51,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:51,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 05:20:51,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,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 05:20:51,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:51,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:51,600 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:51,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:51,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,625 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:51,626 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:20:51,627 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 05:20:51,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:51,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:51,792 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:51,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:20:51,793 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:51,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 05:20:51,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:51,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 05:20:51,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2022-12-06 05:20:51,793 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 05:20:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash 443446415, now seen corresponding path program 1 times [2022-12-06 05:20:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:51,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522274691] [2022-12-06 05:20:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:51,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522274691] [2022-12-06 05:20:51,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522274691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:51,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:51,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:51,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826635238] [2022-12-06 05:20:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:51,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:51,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:51,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:51,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:51,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:51,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:51,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:52,149 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:52,149 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:20:52,156 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 05:20:52,163 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:52,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:52,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:52,164 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:52,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:52,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 05:20:52,198 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,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 05:20:52,199 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:52,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:52,199 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:52,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:52,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,224 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:52,224 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:52,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 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 05:20:52,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:52,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:52,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:20:52,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:52,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 05:20:52,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:52,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 05:20:52,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2022-12-06 05:20:52,367 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 05:20:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2108710546, now seen corresponding path program 1 times [2022-12-06 05:20:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:52,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804257029] [2022-12-06 05:20:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:52,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 05:20:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:52,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804257029] [2022-12-06 05:20:52,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804257029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:52,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:52,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291441835] [2022-12-06 05:20:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:52,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:52,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:52,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 05:20:52,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:52,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:52,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:52,718 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:52,718 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:20:52,725 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 05:20:52,733 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:52,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:52,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:52,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 05:20:52,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:52,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 05:20:52,766 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,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 05:20:52,767 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:52,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:52,767 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:52,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:52,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,792 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:52,792 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:20:52,793 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 05:20:52,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:52,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:52,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:52,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:20:52,934 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:52,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 05:20:52,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:52,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 05:20:52,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2022-12-06 05:20:52,935 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 05:20:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -365900211, now seen corresponding path program 1 times [2022-12-06 05:20:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:52,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709581896] [2022-12-06 05:20:52,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:53,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 05:20:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709581896] [2022-12-06 05:20:53,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709581896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:53,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:53,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722692778] [2022-12-06 05:20:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:53,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:53,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:53,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:53,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:53,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:53,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:53,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:53,283 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:53,283 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:53,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 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 05:20:53,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:53,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:53,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:53,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 05:20:53,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:53,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 05:20:53,330 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,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 05:20:53,331 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:53,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:53,331 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:53,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:53,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,356 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:53,357 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:53,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 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 05:20:53,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:53,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:53,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:20:53,525 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:53,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 05:20:53,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:53,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:53,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2022-12-06 05:20:53,525 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 05:20:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1376910124, now seen corresponding path program 1 times [2022-12-06 05:20:53,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:53,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776123854] [2022-12-06 05:20:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:53,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 05:20:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:53,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776123854] [2022-12-06 05:20:53,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776123854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:53,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:53,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:53,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098532939] [2022-12-06 05:20:53,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:53,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:53,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:53,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:53,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:53,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:53,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 05:20:53,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:53,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:53,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:53,851 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:53,851 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:53,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:20:53,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:53,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:53,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:53,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 05:20:53,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:53,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 05:20:53,901 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,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 05:20:53,902 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:53,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:53,902 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:53,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:53,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,927 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:53,927 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:20:53,928 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 05:20:53,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:53,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:54,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:54,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:54,077 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:54,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 05:20:54,077 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:54,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 05:20:54,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2022-12-06 05:20:54,077 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 05:20:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1175246837, now seen corresponding path program 1 times [2022-12-06 05:20:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:54,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133459884] [2022-12-06 05:20:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:54,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 05:20:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:54,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133459884] [2022-12-06 05:20:54,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133459884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:54,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:54,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:54,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826067270] [2022-12-06 05:20:54,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:54,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:54,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:54,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:54,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:54,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 05:20:54,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:54,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:54,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:54,443 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:54,443 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:20:54,449 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 05:20:54,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:54,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:54,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:54,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 05:20:54,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:54,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 05:20:54,485 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:54,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 05:20:54,486 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:54,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:54,486 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:54,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:54,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:54,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:54,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:54,511 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:54,511 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:20:54,512 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 05:20:54,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:54,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:54,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:54,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:20:54,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:54,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 05:20:54,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:54,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 05:20:54,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2022-12-06 05:20:54,666 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 05:20:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 567563498, now seen corresponding path program 1 times [2022-12-06 05:20:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:54,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247203378] [2022-12-06 05:20:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:54,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:54,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 05:20:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247203378] [2022-12-06 05:20:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247203378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:54,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:54,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806102205] [2022-12-06 05:20:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:54,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:54,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:54,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:54,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 05:20:54,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:54,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:54,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:55,005 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:55,005 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:55,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:55,021 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:55,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:55,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:55,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 05:20:55,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:55,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 05:20:55,057 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,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 05:20:55,057 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:55,058 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:55,058 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,058 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:55,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:55,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,084 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:55,084 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:55,085 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 05:20:55,087 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,087 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:55,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:55,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:20:55,253 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:55,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:55,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:55,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2022-12-06 05:20:55,253 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 05:20:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1984593463, now seen corresponding path program 1 times [2022-12-06 05:20:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:55,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239219627] [2022-12-06 05:20:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:55,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 05:20:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:55,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239219627] [2022-12-06 05:20:55,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239219627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:55,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:55,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62934264] [2022-12-06 05:20:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:55,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:55,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:55,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:55,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20: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 05:20:55,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:55,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:55,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:55,576 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:55,576 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:55,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:55,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:55,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:55,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:55,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 05:20:55,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:55,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 05:20:55,649 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,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 05:20:55,649 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:55,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:55,650 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:55,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:55,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,675 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:55,675 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:55,676 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 05:20:55,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:55,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:55,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:55,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:20:55,826 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:55,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:55,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:55,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2022-12-06 05:20:55,826 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 05:20:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -241783128, now seen corresponding path program 1 times [2022-12-06 05:20:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:55,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507670711] [2022-12-06 05:20:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:55,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 05:20:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:55,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507670711] [2022-12-06 05:20:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507670711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:55,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178156781] [2022-12-06 05:20:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:55,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:55,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:55,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 05:20:55,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:55,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:55,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:56,172 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:56,172 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:56,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 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 05:20:56,187 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:56,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:56,188 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:56,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 05:20:56,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:56,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 05:20:56,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,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 05:20:56,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:56,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:56,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:56,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:56,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,246 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:56,246 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:20:56,247 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 05:20:56,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:56,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:56,404 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:20:56,404 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:56,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 05:20:56,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:56,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 05:20:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2022-12-06 05:20:56,404 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 05:20:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1501027207, now seen corresponding path program 1 times [2022-12-06 05:20:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:56,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291131315] [2022-12-06 05:20:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:56,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291131315] [2022-12-06 05:20:56,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291131315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:56,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:56,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329227160] [2022-12-06 05:20:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:56,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:56,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:56,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:56,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:56,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 05:20:56,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:56,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:56,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:56,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:56,752 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:56,761 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 05:20:56,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:56,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:56,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:56,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 05:20:56,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:56,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 05:20:56,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,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 05:20:56,805 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:56,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:56,805 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:56,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:56,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,831 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:56,832 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:20:56,833 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 05:20:56,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:56,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:56,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:56,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:20:56,995 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:56,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 05:20:56,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:56,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 05:20:56,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2022-12-06 05:20:56,995 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 05:20:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1051129754, now seen corresponding path program 1 times [2022-12-06 05:20:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:56,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375959185] [2022-12-06 05:20:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:57,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 05:20:57,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:57,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375959185] [2022-12-06 05:20:57,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375959185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:57,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:57,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329607779] [2022-12-06 05:20:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:57,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:57,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:57,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:57,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 05:20:57,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:57,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:57,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:57,337 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:57,337 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:57,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:20:57,351 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:57,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:57,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:57,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 05:20:57,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:57,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:57,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,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 05:20:57,386 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:57,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:57,386 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:57,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:57,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,411 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:57,411 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:20:57,412 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 05:20:57,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:57,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:57,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:20:57,564 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:57,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 05:20:57,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:57,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 05:20:57,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2022-12-06 05:20:57,564 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 05:20:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 691680581, now seen corresponding path program 1 times [2022-12-06 05:20:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:57,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105550143] [2022-12-06 05:20:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:57,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 05:20:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:57,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105550143] [2022-12-06 05:20:57,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105550143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:57,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161478711] [2022-12-06 05:20:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:57,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:57,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:57,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:57,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:57,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:57,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:57,885 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:57,885 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:57,892 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 05:20:57,899 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:57,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:57,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:57,900 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:20:57,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:57,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:57,932 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,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 05:20:57,933 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:57,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:57,933 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:57,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:57,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,958 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:57,958 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:20:57,959 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 05:20:57,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:57,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:58,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:58,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:20:58,102 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:58,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:58,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:58,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:58,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2022-12-06 05:20:58,102 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 05:20:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1860476380, now seen corresponding path program 1 times [2022-12-06 05:20:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:58,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822628030] [2022-12-06 05:20:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:58,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:58,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822628030] [2022-12-06 05:20:58,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822628030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:58,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:58,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:58,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256761132] [2022-12-06 05:20:58,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:58,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:58,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:58,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:58,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:58,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 05:20:58,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:58,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:58,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:58,428 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:58,429 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:20:58,435 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 05:20:58,442 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:58,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:58,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:58,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 05:20:58,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:58,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 05:20:58,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:58,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:58,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:58,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:58,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:58,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:58,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:58,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:58,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:58,501 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:58,501 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:20:58,502 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 05:20:58,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:58,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:58,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:58,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:20:58,652 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:58,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 05:20:58,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:58,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 05:20:58,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2022-12-06 05:20:58,653 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 05:20:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash -117666045, now seen corresponding path program 1 times [2022-12-06 05:20:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:58,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715695208] [2022-12-06 05:20:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:58,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 05:20:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:58,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715695208] [2022-12-06 05:20:58,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715695208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:58,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:58,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645926128] [2022-12-06 05:20:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:58,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:58,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:58,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:58,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:58,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 05:20:58,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:58,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:58,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:58,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:58,989 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:20:58,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 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 05:20:59,003 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:59,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:59,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:59,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 05:20:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:59,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 05:20:59,038 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,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 05:20:59,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:59,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:59,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:59,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:59,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,063 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:20:59,063 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:20:59,064 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 05:20:59,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:59,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:59,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:20:59,211 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:59,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:59,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:59,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:59,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2022-12-06 05:20:59,211 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 05:20:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1625144290, now seen corresponding path program 1 times [2022-12-06 05:20:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:59,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880436787] [2022-12-06 05:20:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:59,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 05:20:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880436787] [2022-12-06 05:20:59,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880436787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:59,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:59,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917436027] [2022-12-06 05:20:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:59,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:59,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:59,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 05:20:59,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:59,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:59,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:59,554 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:20:59,554 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:20:59,561 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 05:20:59,567 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:20:59,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:20:59,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:20:59,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 05:20:59,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:20:59,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 05:20:59,601 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:20:59,601 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:20:59,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:59,601 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:59,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:59,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,627 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:20:59,628 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:20:59,629 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 05:20:59,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:20:59,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:20:59,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:59,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:20:59,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:20:59,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 05:20:59,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:59,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 05:20:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2022-12-06 05:20:59,776 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 05:20:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash -927012671, now seen corresponding path program 1 times [2022-12-06 05:20:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:59,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209443090] [2022-12-06 05:20:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:59,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 05:20:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209443090] [2022-12-06 05:20:59,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209443090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:59,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:59,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003232388] [2022-12-06 05:20:59,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:59,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:59,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:20:59,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 05:20:59,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:59,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:20:59,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:00,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:00,128 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:00,135 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 05:21:00,143 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:00,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:00,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:00,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:00,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:00,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 05:21:00,176 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,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 05:21:00,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:00,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:00,176 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:00,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:00,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,202 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:00,202 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:00,203 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 05:21:00,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:00,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:00,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:21:00,363 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:00,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 05:21:00,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:00,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 05:21:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2022-12-06 05:21:00,363 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 05:21:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash 815797664, now seen corresponding path program 1 times [2022-12-06 05:21:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:00,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066358752] [2022-12-06 05:21:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:00,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:00,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066358752] [2022-12-06 05:21:00,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066358752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:00,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:00,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631503320] [2022-12-06 05:21:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:00,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:00,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:00,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:00,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:00,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:00,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:00,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:00,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:00,727 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:00,727 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:00,733 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 05:21:00,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:00,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:00,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:00,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 05:21:00,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:00,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 05:21:00,768 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,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 05:21:00,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:00,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:00,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:00,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:00,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,793 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:00,794 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:21:00,795 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 05:21:00,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:00,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:00,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:00,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:21:00,954 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:00,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:00,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:00,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:00,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2022-12-06 05:21:00,955 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 05:21:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1736359297, now seen corresponding path program 1 times [2022-12-06 05:21:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:00,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701632161] [2022-12-06 05:21:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:01,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:01,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701632161] [2022-12-06 05:21:01,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701632161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:01,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:01,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:01,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327655357] [2022-12-06 05:21:01,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:01,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:01,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:01,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:01,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:01,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:01,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:01,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:01,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:01,280 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:01,280 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:01,287 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 05:21:01,295 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:01,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:01,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:01,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 05:21:01,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:01,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 05:21:01,330 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21: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 05:21:01,330 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:01,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:01,330 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:01,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:01,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,356 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:01,356 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:21:01,357 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 05:21:01,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:01,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:01,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:21:01,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:01,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 05:21:01,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:01,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 05:21:01,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2022-12-06 05:21:01,511 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 05:21:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 6451038, now seen corresponding path program 1 times [2022-12-06 05:21:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819174337] [2022-12-06 05:21:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:01,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 05:21:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:01,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819174337] [2022-12-06 05:21:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819174337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:01,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990674264] [2022-12-06 05:21:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:01,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:01,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:01,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:01,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 05:21:01,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:01,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:01,855 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:01,855 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:01,862 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 05:21:01,870 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:01,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:01,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:01,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 05:21:01,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:01,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 05:21:01,903 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,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 05:21:01,903 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:01,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:01,903 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:01,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:01,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,939 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:01,939 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:01,940 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 05:21:01,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:01,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:02,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:02,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:21:02,100 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:02,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 05:21:02,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:02,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 05:21:02,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2022-12-06 05:21:02,101 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 05:21:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1749261373, now seen corresponding path program 1 times [2022-12-06 05:21:02,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:02,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454113786] [2022-12-06 05:21:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:02,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:02,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454113786] [2022-12-06 05:21:02,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454113786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:02,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:02,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931458848] [2022-12-06 05:21:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:02,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:02,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:02,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:02,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 05:21:02,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:02,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:02,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:02,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:02,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:02,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 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 05:21:02,441 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:02,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:02,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:02,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 05:21:02,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:02,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 05:21:02,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:02,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:02,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:02,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:02,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:02,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:02,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:02,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:02,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:02,501 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:02,502 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:02,503 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 05:21:02,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:02,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:02,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:02,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:21:02,659 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:02,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 05:21:02,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:02,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 05:21:02,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2022-12-06 05:21:02,660 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 05:21:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash -802895588, now seen corresponding path program 1 times [2022-12-06 05:21:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:02,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518805670] [2022-12-06 05:21:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21: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 05:21:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:02,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518805670] [2022-12-06 05:21:02,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518805670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:02,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:02,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109216177] [2022-12-06 05:21:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:02,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:02,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21: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 05:21:02,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:02,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:02,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:03,005 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:03,005 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:03,013 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 05:21:03,020 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:03,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:03,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:03,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 05:21:03,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:03,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 05:21:03,055 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,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 05:21:03,055 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:03,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:03,055 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:03,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:03,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,080 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:03,081 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:21:03,082 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 05:21:03,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:03,222 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:03,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:21:03,223 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:03,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 05:21:03,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:03,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 05:21:03,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2022-12-06 05:21:03,224 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 05:21:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 939914747, now seen corresponding path program 1 times [2022-12-06 05:21:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:03,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912398967] [2022-12-06 05:21:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:03,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 05:21:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:03,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912398967] [2022-12-06 05:21:03,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912398967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:03,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:03,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:03,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809809090] [2022-12-06 05:21:03,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:03,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:03,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:03,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:03,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 05:21:03,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:03,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:03,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:03,571 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:03,571 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:03,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:03,585 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:03,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:03,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:03,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 05:21:03,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:03,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:03,620 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:03,620 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:03,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:03,620 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:03,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:03,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,646 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:03,646 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:21:03,647 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 05:21:03,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:03,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:03,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:03,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:21:03,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:03,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 05:21:03,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:03,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 05:21:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2022-12-06 05:21:03,809 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 05:21:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1612242214, now seen corresponding path program 1 times [2022-12-06 05:21:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:03,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596640419] [2022-12-06 05:21:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:03,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 05:21:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596640419] [2022-12-06 05:21:03,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596640419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:03,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:03,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691856839] [2022-12-06 05:21:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:03,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:03,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:03,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:03,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 05:21:03,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:03,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:03,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:04,137 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:04,138 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:04,144 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 05:21:04,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:04,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:04,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:04,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 05:21:04,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:04,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:04,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,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 05:21:04,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:04,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:04,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:04,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:04,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,212 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:04,213 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:04,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 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 05:21:04,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:04,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:04,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:04,360 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:04,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:04,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:04,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:04,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2022-12-06 05:21:04,361 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 05:21:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 130568121, now seen corresponding path program 1 times [2022-12-06 05:21:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806154694] [2022-12-06 05:21:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:04,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 05:21:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:04,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806154694] [2022-12-06 05:21:04,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806154694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:04,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:04,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156928127] [2022-12-06 05:21:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:04,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:04,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:04,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:04,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:04,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:04,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:04,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:04,692 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:04,693 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:04,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:04,705 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:04,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:04,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:04,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 05:21:04,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:04,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 05:21:04,737 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,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 05:21:04,737 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:04,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:04,737 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:04,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:04,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,762 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:04,762 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:21:04,763 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 05:21:04,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:04,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:04,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:04,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:21:04,911 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:04,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:04,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:04,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:04,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2022-12-06 05:21:04,912 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 05:21:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1873378456, now seen corresponding path program 1 times [2022-12-06 05:21:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:04,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431681097] [2022-12-06 05:21:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:04,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431681097] [2022-12-06 05:21:04,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431681097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:04,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:04,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000109592] [2022-12-06 05:21:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:04,971 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:04,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:04,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:04,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:04,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:05,246 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:05,246 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:05,253 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 05:21:05,260 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:05,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:05,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:05,261 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:05,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:05,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 05:21:05,294 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,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 05:21:05,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:05,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:05,294 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:05,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:05,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,319 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:05,319 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 05:21:05,320 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 05:21:05,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:05,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:05,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:21:05,462 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:05,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 05:21:05,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:05,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 05:21:05,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2022-12-06 05:21:05,462 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 05:21:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash -678778505, now seen corresponding path program 1 times [2022-12-06 05:21:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:05,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591430952] [2022-12-06 05:21:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:05,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 05:21:05,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:05,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591430952] [2022-12-06 05:21:05,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591430952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:05,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554197610] [2022-12-06 05:21:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:05,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:05,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:05,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 05:21:05,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:05,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:05,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:05,828 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:05,828 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:21:05,834 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 05:21:05,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:05,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:05,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:05,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 05:21:05,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:05,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:05,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,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 05:21:05,869 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:05,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:05,869 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:05,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:05,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:05,894 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:05,895 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 05:21:05,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:05,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:06,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:06,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:21:06,040 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:06,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 05:21:06,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:06,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 05:21:06,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2022-12-06 05:21:06,040 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 05:21:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1064031830, now seen corresponding path program 1 times [2022-12-06 05:21:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:06,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657395788] [2022-12-06 05:21:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657395788] [2022-12-06 05:21:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657395788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:06,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:06,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474268388] [2022-12-06 05:21:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:06,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:06,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:06,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:06,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:06,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:06,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:06,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:06,370 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:06,370 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:06,384 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:06,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:06,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:06,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 05:21:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:06,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 05:21:06,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,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 05:21:06,419 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:06,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:06,419 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:06,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:06,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,444 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:06,444 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:21:06,445 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 05:21:06,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:06,610 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:06,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:21:06,611 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:06,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 05:21:06,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:06,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 05:21:06,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2022-12-06 05:21:06,611 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 05:21:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1488125131, now seen corresponding path program 1 times [2022-12-06 05:21:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:06,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358257035] [2022-12-06 05:21:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:06,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358257035] [2022-12-06 05:21:06,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358257035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:06,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:06,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532794361] [2022-12-06 05:21:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:06,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:06,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:06,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:06,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:06,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:06,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:06,941 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:06,941 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:06,948 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 05:21:06,955 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:06,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:06,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:06,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 05:21:06,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:06,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 05:21:06,990 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,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 05:21:06,990 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:06,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:06,990 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:06,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:06,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:06,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,043 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:07,044 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:07,045 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 05:21:07,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:07,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:07,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 05:21:07,234 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:07,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 05:21:07,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:07,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 05:21:07,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2022-12-06 05:21:07,234 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 05:21:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 254685204, now seen corresponding path program 1 times [2022-12-06 05:21:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:07,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164662644] [2022-12-06 05:21:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:07,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 05:21:07,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:07,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164662644] [2022-12-06 05:21:07,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164662644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:07,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:07,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374319059] [2022-12-06 05:21:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:07,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:07,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:07,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:07,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 05:21:07,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:07,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:07,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:07,563 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:07,563 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:07,570 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 05:21:07,578 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:07,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:07,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:07,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 05:21:07,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:07,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 05:21:07,611 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:07,611 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:07,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:07,611 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:07,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:07,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,636 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:07,636 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 05:21:07,637 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 05:21:07,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:07,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:07,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:07,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:21:07,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:07,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:07,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:07,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:07,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2022-12-06 05:21:07,778 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 05:21:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1997495539, now seen corresponding path program 1 times [2022-12-06 05:21:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:07,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814370284] [2022-12-06 05:21:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814370284] [2022-12-06 05:21:07,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814370284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:07,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:07,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412487311] [2022-12-06 05:21:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:07,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:07,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 05:21:07,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:07,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:07,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:08,125 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:08,125 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:08,132 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 05:21:08,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:08,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:08,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:08,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 05:21:08,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:08,172 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:08,172 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:08,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:08,173 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:08,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:08,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,197 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:08,197 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:08,198 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 05:21:08,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:08,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:08,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:21:08,361 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:08,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 05:21:08,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:08,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:08,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2022-12-06 05:21:08,362 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 05:21:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -554661422, now seen corresponding path program 1 times [2022-12-06 05:21:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686400453] [2022-12-06 05:21:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:08,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:08,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686400453] [2022-12-06 05:21:08,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686400453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:08,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:08,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711660545] [2022-12-06 05:21:08,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:08,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:08,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:08,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 05:21:08,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:08,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:08,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:08,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:08,717 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:08,723 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 05:21:08,731 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:08,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:08,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:08,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 05:21:08,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:08,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 05:21:08,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,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 05:21:08,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:08,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:08,764 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:08,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:08,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,789 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:08,789 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:08,790 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 05:21:08,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:08,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:08,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:08,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:21:08,941 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:08,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 05:21:08,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:08,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 05:21:08,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2022-12-06 05:21:08,941 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 05:21:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1188148913, now seen corresponding path program 1 times [2022-12-06 05:21:08,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:08,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484460325] [2022-12-06 05:21:08,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:08,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:09,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 05:21:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:09,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484460325] [2022-12-06 05:21:09,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484460325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:09,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:09,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927037268] [2022-12-06 05:21:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:09,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:09,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:09,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:09,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:09,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 05:21:09,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:09,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:09,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:09,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:09,284 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:09,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 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 05:21:09,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:09,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:09,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:09,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 05:21:09,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:09,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 05:21:09,331 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,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 05:21:09,331 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:09,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:09,331 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:09,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:09,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,356 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:09,356 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:09,357 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 05:21:09,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:09,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:09,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:21:09,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:09,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 05:21:09,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:09,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 05:21:09,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2022-12-06 05:21:09,511 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 05:21:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1364008048, now seen corresponding path program 1 times [2022-12-06 05:21:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:09,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557875676] [2022-12-06 05:21:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:09,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 05:21:09,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:09,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557875676] [2022-12-06 05:21:09,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557875676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:09,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:09,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871649554] [2022-12-06 05:21:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:09,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:09,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:09,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:09,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:09,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:09,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 05:21:09,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:09,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:09,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:09,852 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:09,852 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:09,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:09,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:09,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:09,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:09,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 05:21:09,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:09,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 05:21:09,900 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,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 05:21:09,901 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:09,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:09,901 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:09,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:09,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,925 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:09,926 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:09,927 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 05:21:09,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:09,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:10,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:10,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:21:10,082 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:10,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 05:21:10,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:10,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 05:21:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2022-12-06 05:21:10,082 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 05:21:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 378802287, now seen corresponding path program 1 times [2022-12-06 05:21:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:10,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556958264] [2022-12-06 05:21:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:10,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 05:21:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:10,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556958264] [2022-12-06 05:21:10,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556958264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:10,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:10,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426396356] [2022-12-06 05:21:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:10,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:10,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:10,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:10,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 05:21:10,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:10,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:10,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:10,412 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:10,413 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:10,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 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 05:21:10,427 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:10,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:10,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:10,428 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:10,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:10,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:10,460 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:10,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 05:21:10,461 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:10,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:10,461 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:10,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:10,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:10,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:10,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:10,486 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:10,486 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 05:21:10,487 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 05:21:10,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:10,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:10,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:10,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:21:10,629 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:10,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 05:21:10,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:10,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:10,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2022-12-06 05:21:10,630 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 05:21:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2121612622, now seen corresponding path program 1 times [2022-12-06 05:21:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:10,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331008011] [2022-12-06 05:21:10,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:10,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:10,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 05:21:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:10,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331008011] [2022-12-06 05:21:10,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331008011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:10,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:10,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713635129] [2022-12-06 05:21:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:10,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:10,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:10,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:10,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:10,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 05:21:10,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:10,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:10,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:10,980 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:10,981 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:10,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 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 05:21:10,992 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:10,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:10,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:10,993 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:10,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:11,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 05:21:11,020 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:11,021 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:11,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:11,021 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:11,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:11,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,046 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:11,046 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:21:11,047 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 05:21:11,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:11,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:11,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:21:11,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:11,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 05:21:11,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:11,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 05:21:11,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2022-12-06 05:21:11,201 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 05:21:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash -430544339, now seen corresponding path program 1 times [2022-12-06 05:21:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946027285] [2022-12-06 05:21:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:11,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946027285] [2022-12-06 05:21:11,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946027285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:11,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:11,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905926479] [2022-12-06 05:21:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:11,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:11,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:11,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:11,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:11,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:11,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:11,549 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:11,549 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:11,556 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 05:21:11,563 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:11,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:11,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:11,564 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:11,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:11,596 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:11,596 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:11,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:11,597 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:11,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:11,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,621 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:11,621 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:11,622 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 05:21:11,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:11,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:11,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:11,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:21:11,774 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:11,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 05:21:11,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:11,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 05:21:11,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2022-12-06 05:21:11,775 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 05:21:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1312265996, now seen corresponding path program 1 times [2022-12-06 05:21:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:11,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246316305] [2022-12-06 05:21:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:11,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:11,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246316305] [2022-12-06 05:21:11,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246316305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:11,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:11,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:11,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279859592] [2022-12-06 05:21:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:11,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:11,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:11,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:11,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:11,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:11,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:12,121 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:12,121 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:12,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:12,163 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:12,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:12,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:12,164 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:12,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:12,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:12,193 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,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 05:21:12,194 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:12,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:12,194 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:12,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:12,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,219 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:12,219 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:12,221 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 05:21:12,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:12,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:12,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:21:12,381 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:12,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 05:21:12,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:12,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 05:21:12,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2022-12-06 05:21:12,381 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 05:21:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1239890965, now seen corresponding path program 1 times [2022-12-06 05:21:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:12,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262736255] [2022-12-06 05:21:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:12,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 05:21:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:12,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262736255] [2022-12-06 05:21:12,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262736255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:12,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:12,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682327173] [2022-12-06 05:21:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:12,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:12,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:12,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 05:21:12,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:12,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:12,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:12,709 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:12,710 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:12,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:12,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:12,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:12,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:12,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 05:21:12,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:12,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 05:21:12,758 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,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 05:21:12,758 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:12,758 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:12,758 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,758 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:12,758 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:12,758 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,783 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:12,783 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:21:12,785 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 05:21:12,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:12,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:12,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:12,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:21:12,929 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:12,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 05:21:12,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:12,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 05:21:12,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2022-12-06 05:21:12,929 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 05:21:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash 502919370, now seen corresponding path program 1 times [2022-12-06 05:21:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:12,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094997442] [2022-12-06 05:21:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:12,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 05:21:12,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:12,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094997442] [2022-12-06 05:21:12,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094997442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:12,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:12,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820901459] [2022-12-06 05:21:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:12,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:12,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:12,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:12,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:12,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:12,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:13,276 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:13,276 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:21:13,283 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 05:21:13,291 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:13,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:13,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:13,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 05:21:13,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:13,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:13,325 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:13,325 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:13,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:13,325 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:13,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:13,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,350 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:13,350 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:13,351 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 05:21:13,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:13,511 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:13,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:21:13,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:13,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 05:21:13,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:13,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 05:21:13,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2022-12-06 05:21:13,512 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 05:21:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2049237591, now seen corresponding path program 1 times [2022-12-06 05:21:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:13,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021577323] [2022-12-06 05:21:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:13,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 05:21:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:13,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021577323] [2022-12-06 05:21:13,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021577323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:13,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:13,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916508847] [2022-12-06 05:21:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:13,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:13,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:13,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 05:21:13,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:13,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:13,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:13,836 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:13,836 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:13,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 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 05:21:13,850 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:13,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:13,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:13,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 05:21:13,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:13,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 05:21:13,886 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,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 05:21:13,886 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:13,886 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:13,886 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:13,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:13,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,911 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:13,911 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:13,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 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 05:21:13,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:13,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:14,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:14,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:14,062 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:14,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:14,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:14,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:14,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2022-12-06 05:21:14,062 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 05:21:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -306427256, now seen corresponding path program 1 times [2022-12-06 05:21:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:14,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673291635] [2022-12-06 05:21:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:14,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673291635] [2022-12-06 05:21:14,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673291635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:14,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:14,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994910601] [2022-12-06 05:21:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:14,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:14,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:14,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:14,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:14,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:14,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:14,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:14,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:14,393 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:14,393 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:21:14,400 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 05:21:14,407 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:14,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:14,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:14,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 05:21:14,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:14,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:14,441 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:14,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:14,441 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:14,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:14,441 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:14,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:14,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:14,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:14,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:14,466 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:14,466 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:14,467 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 05:21:14,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:14,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:14,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:14,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:14,616 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:14,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:14,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:14,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 05:21:14,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2022-12-06 05:21:14,616 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 05:21:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1436383079, now seen corresponding path program 1 times [2022-12-06 05:21:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:14,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795107719] [2022-12-06 05:21:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:14,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 05:21:14,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:14,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795107719] [2022-12-06 05:21:14,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795107719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:14,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:14,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68647454] [2022-12-06 05:21:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:14,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:14,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:14,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:14,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 05:21:14,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:14,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:14,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:14,963 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:14,964 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:14,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:14,978 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:14,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:14,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:14,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 05:21:14,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:15,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 05:21:15,012 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:15,012 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:15,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:15,012 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:15,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:15,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,042 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:15,042 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:21:15,043 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 05:21:15,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:15,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:15,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:15,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:15,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 05:21:15,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:15,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 05:21:15,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2022-12-06 05:21:15,186 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 05:21:15,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1115773882, now seen corresponding path program 1 times [2022-12-06 05:21:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:15,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029186448] [2022-12-06 05:21:15,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:15,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029186448] [2022-12-06 05:21:15,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029186448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:15,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:15,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965255183] [2022-12-06 05:21:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:15,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:15,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:15,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:15,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 05:21:15,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:15,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:15,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:15,531 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:15,531 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:15,538 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 05:21:15,545 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:15,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:15,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:15,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 05:21:15,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:15,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 05:21:15,576 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,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 05:21:15,577 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:15,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:15,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:15,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:15,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,601 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:15,601 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:15,602 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 05:21:15,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:15,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:15,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:15,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:21:15,758 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:15,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 05:21:15,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:15,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 05:21:15,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2022-12-06 05:21:15,758 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 05:21:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash 627036453, now seen corresponding path program 1 times [2022-12-06 05:21:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:15,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729864384] [2022-12-06 05:21:15,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:15,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 05:21:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:15,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729864384] [2022-12-06 05:21:15,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729864384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:15,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:15,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124487177] [2022-12-06 05:21:15,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:15,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:15,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:15,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 05:21:15,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:15,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:15,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:16,115 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:16,115 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:16,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:16,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:16,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:16,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:16,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 05:21:16,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:16,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 05:21:16,158 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,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 05:21:16,159 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:16,159 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:16,159 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:16,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:16,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,183 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:16,184 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:16,185 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 05:21:16,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:16,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:16,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:21:16,330 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:16,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:16,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:16,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:16,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2022-12-06 05:21:16,330 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 05:21:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1925120508, now seen corresponding path program 1 times [2022-12-06 05:21:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:16,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461185375] [2022-12-06 05:21:16,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:16,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 05:21:16,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:16,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461185375] [2022-12-06 05:21:16,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461185375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:16,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:16,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17823217] [2022-12-06 05:21:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:16,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:16,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 05:21:16,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:16,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:16,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:16,659 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:16,659 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:16,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 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 05:21:16,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:16,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:16,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:16,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 05:21:16,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:16,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 05:21:16,708 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,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 05:21:16,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:16,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:16,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:16,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:16,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,733 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:16,733 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:16,734 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 05:21:16,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:16,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:16,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:16,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:21:16,880 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:16,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 05:21:16,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:16,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 05:21:16,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2022-12-06 05:21:16,880 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 05:21:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -182310173, now seen corresponding path program 1 times [2022-12-06 05:21:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:16,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88429823] [2022-12-06 05:21:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:16,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:16,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88429823] [2022-12-06 05:21:16,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88429823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:16,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:16,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474686240] [2022-12-06 05:21:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:16,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:16,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:16,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:16,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:16,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:16,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:17,245 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:17,245 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:17,250 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 05:21:17,256 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:17,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:17,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:17,257 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:17,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:17,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 05:21:17,285 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,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 05:21:17,285 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:17,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:17,286 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:17,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:17,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,311 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:17,311 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:17,312 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 05:21:17,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:17,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:17,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:21:17,463 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:17,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 05:21:17,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:17,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 05:21:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2022-12-06 05:21:17,463 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 05:21:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1560500162, now seen corresponding path program 1 times [2022-12-06 05:21:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:17,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489451136] [2022-12-06 05:21:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:17,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 05:21:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:17,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489451136] [2022-12-06 05:21:17,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489451136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:17,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:17,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173502372] [2022-12-06 05:21:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:17,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:17,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:17,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 05:21:17,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:17,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:17,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:17,793 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:17,793 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:17,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:17,807 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:17,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:17,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:17,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:17,812 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:17,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:17,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:17,858 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:17,858 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:17,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:17,858 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:17,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:17,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:17,893 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:17,895 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 05:21:17,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:17,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:18,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:18,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:21:18,046 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:18,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:18,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:18,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 05:21:18,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2022-12-06 05:21:18,047 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 05:21:18,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:18,047 INFO L85 PathProgramCache]: Analyzing trace with hash -991656799, now seen corresponding path program 1 times [2022-12-06 05:21:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:18,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115928910] [2022-12-06 05:21:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:18,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 05:21:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115928910] [2022-12-06 05:21:18,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115928910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:18,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:18,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:18,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216339981] [2022-12-06 05:21:18,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:18,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:18,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:18,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 05:21:18,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:18,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:18,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:18,387 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:18,387 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:18,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 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 05:21:18,401 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:18,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:18,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:18,402 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:18,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:18,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 05:21:18,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,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 05:21:18,434 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:18,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:18,434 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:18,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:18,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,464 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:18,465 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:18,465 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 05:21:18,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:18,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:18,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:18,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:18,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 05:21:18,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:18,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 05:21:18,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2022-12-06 05:21:18,607 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 05:21:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash 751153536, now seen corresponding path program 1 times [2022-12-06 05:21:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247308610] [2022-12-06 05:21:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21: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 05:21:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:18,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247308610] [2022-12-06 05:21:18,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247308610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:18,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:18,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:18,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507419085] [2022-12-06 05:21:18,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:18,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:18,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:18,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:18,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21: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 05:21:18,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:18,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:18,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:18,925 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:18,925 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:18,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:18,939 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:18,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:18,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:18,940 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:18,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:18,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 05:21:18,973 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,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 05:21:18,973 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:18,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:18,973 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:18,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:18,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:18,998 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:18,998 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:18,999 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 05:21:19,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:19,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:19,146 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:19,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:19,147 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:19,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:19,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:19,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:19,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2022-12-06 05:21:19,147 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 05:21:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1801003425, now seen corresponding path program 1 times [2022-12-06 05:21:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673442752] [2022-12-06 05:21:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:19,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 05:21:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:19,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673442752] [2022-12-06 05:21:19,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673442752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:19,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:19,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286347545] [2022-12-06 05:21:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:19,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:19,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:19,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 05:21:19,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:19,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:19,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:19,472 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:19,472 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:19,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:19,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:19,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:19,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:19,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 05:21:19,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:19,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 05:21:19,520 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:19,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 05:21:19,520 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:19,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:19,520 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:19,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:19,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:19,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:19,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:19,545 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:19,545 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:21:19,546 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 05:21:19,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:19,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:19,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:19,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:19,696 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:19,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 05:21:19,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:19,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 05:21:19,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2022-12-06 05:21:19,696 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 05:21:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -58193090, now seen corresponding path program 1 times [2022-12-06 05:21:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:19,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065825151] [2022-12-06 05:21:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:19,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065825151] [2022-12-06 05:21:19,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065825151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:19,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:19,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:19,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476402659] [2022-12-06 05:21:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:19,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:19,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:19,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:19,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:19,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:19,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:20,024 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:20,024 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:20,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:20,038 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:20,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:20,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:20,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 05:21:20,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:20,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:20,073 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:20,073 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:20,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:20,074 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:20,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:20,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,098 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:20,099 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:20,099 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 05:21:20,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:20,248 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:20,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:20,248 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:20,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:20,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:20,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2022-12-06 05:21:20,248 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 05:21:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1684617245, now seen corresponding path program 1 times [2022-12-06 05:21:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:20,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796427666] [2022-12-06 05:21:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:20,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 05:21:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796427666] [2022-12-06 05:21:20,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796427666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:20,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:20,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540187939] [2022-12-06 05:21:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:20,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:20,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 05:21:20,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:20,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:20,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:20,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:20,587 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:20,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 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 05:21:20,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:20,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:20,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:20,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 05:21:20,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:20,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 05:21:20,636 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,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 05:21:20,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:20,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:20,636 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:20,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:20,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,661 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:20,661 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:20,662 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 05:21:20,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:20,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:20,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:20,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:20,812 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:20,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 05:21:20,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:20,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 05:21:20,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2022-12-06 05:21:20,813 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 05:21:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash -867539716, now seen corresponding path program 1 times [2022-12-06 05:21:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:20,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775914963] [2022-12-06 05:21:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:20,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 05:21:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:20,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775914963] [2022-12-06 05:21:20,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775914963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:20,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:20,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196913690] [2022-12-06 05:21:20,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:20,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:20,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:20,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:20,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:20,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 05:21:20,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:20,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:20,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:21,165 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:21,165 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:21,172 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 05:21:21,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:21,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:21,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:21,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 05:21:21,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:21,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 05:21:21,212 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,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 05:21:21,212 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:21,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:21,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:21,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:21,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,237 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:21,238 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:21:21,239 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 05:21:21,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:21,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:21,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:21:21,385 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:21,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 05:21:21,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:21,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 05:21:21,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2022-12-06 05:21:21,385 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 05:21:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash 875270619, now seen corresponding path program 1 times [2022-12-06 05:21:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:21,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279690231] [2022-12-06 05:21:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:21,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 05:21:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:21,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279690231] [2022-12-06 05:21:21,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279690231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:21,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:21,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847800417] [2022-12-06 05:21:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:21,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:21,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:21,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 05:21:21,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:21,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:21,762 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:21,762 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:21,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:21,782 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:21,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:21,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:21,783 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:21,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:21,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:21,828 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:21,828 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:21,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:21,829 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:21,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:21,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,863 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:21,863 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:21,865 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 05:21:21,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:21,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:22,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:22,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 05:21:22,051 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:22,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 05:21:22,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:22,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 05:21:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2022-12-06 05:21:22,051 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 05:21:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:22,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1676886342, now seen corresponding path program 1 times [2022-12-06 05:21:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600332791] [2022-12-06 05:21:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:22,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 05:21:22,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600332791] [2022-12-06 05:21:22,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600332791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:22,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:22,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116580710] [2022-12-06 05:21:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:22,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:22,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:22,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 05:21:22,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:22,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:22,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:22,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:22,483 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:22,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 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 05:21:22,495 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:22,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:22,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:22,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 05:21:22,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:22,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 05:21:22,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:22,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 05:21:22,527 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:22,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:22,527 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:22,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:22,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:22,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:22,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:22,552 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:22,552 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:21:22,553 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 05:21:22,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:22,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:22,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:22,700 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:22,700 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:22,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:22,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:22,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 05:21:22,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2022-12-06 05:21:22,701 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 05:21:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash 65923993, now seen corresponding path program 1 times [2022-12-06 05:21:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:22,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089058750] [2022-12-06 05:21:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089058750] [2022-12-06 05:21:22,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089058750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:22,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:22,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:22,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579032092] [2022-12-06 05:21:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:22,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:22,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:22,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 05:21:22,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:22,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:22,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:23,041 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:23,041 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:23,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:23,055 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:23,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:23,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:23,056 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:23,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:23,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:23,087 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,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 05:21:23,088 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:23,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:23,088 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:23,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:23,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,112 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:23,113 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:21:23,113 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 05:21:23,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:23,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:23,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:21:23,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:23,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 05:21:23,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:23,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 05:21:23,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2022-12-06 05:21:23,273 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 05:21:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1808734328, now seen corresponding path program 1 times [2022-12-06 05:21:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:23,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678014388] [2022-12-06 05:21:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:23,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 05:21:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:23,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678014388] [2022-12-06 05:21:23,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678014388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:23,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:23,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:23,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646279389] [2022-12-06 05:21:23,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:23,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:23,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:23,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:23,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:23,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 05:21:23,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:23,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:23,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:23,639 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:23,640 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:23,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:23,652 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:23,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:23,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:23,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 05:21:23,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:23,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 05:21:23,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,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 05:21:23,682 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:23,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:23,682 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:23,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:23,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,707 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:23,708 INFO L131 PetriNetUnfolder]: For 3328/3540 co-relation queries the response was YES. [2022-12-06 05:21:23,709 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 05:21:23,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:23,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:23,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:23,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:21:23,851 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:23,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 05:21:23,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:23,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 05:21:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2022-12-06 05:21:23,851 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 05:21:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash -743422633, now seen corresponding path program 1 times [2022-12-06 05:21:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764347725] [2022-12-06 05:21:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:23,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 05:21:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764347725] [2022-12-06 05:21:23,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764347725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:23,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:23,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842419414] [2022-12-06 05:21:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:23,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:23,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 05:21:23,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:23,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:23,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:24,203 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:24,203 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:24,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 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 05:21:24,217 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:24,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:24,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:24,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:24,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 05:21:24,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:24,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:24,250 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:24,250 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:24,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:24,250 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:24,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:24,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,275 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:24,275 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:24,276 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 05:21:24,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:24,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:24,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:21:24,433 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:24,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:24,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:24,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 05:21:24,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2022-12-06 05:21:24,434 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 05:21:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash 999387702, now seen corresponding path program 1 times [2022-12-06 05:21:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:24,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457462074] [2022-12-06 05:21:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:24,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:24,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 05:21:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:24,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457462074] [2022-12-06 05:21:24,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457462074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:24,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:24,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490747689] [2022-12-06 05:21:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:24,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:24,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:24,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 05:21:24,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:24,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:24,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:24,778 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:24,779 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:24,786 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 05:21:24,793 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:24,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:24,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:24,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 05:21:24,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:24,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:24,828 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:24,828 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:24,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:24,828 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:24,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:24,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,873 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:24,873 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:24,874 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 05:21:24,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:24,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:25,042 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:25,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 05:21:25,042 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:25,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:25,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:25,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:25,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2022-12-06 05:21:25,043 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 05:21:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1552769259, now seen corresponding path program 1 times [2022-12-06 05:21:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:25,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658018755] [2022-12-06 05:21:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:25,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 05:21:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:25,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658018755] [2022-12-06 05:21:25,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658018755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:25,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:25,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865417904] [2022-12-06 05:21:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:25,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:25,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:25,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 05:21:25,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:25,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:25,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:25,382 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:25,383 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:25,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:25,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:25,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:25,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:25,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 05:21:25,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:25,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 05:21:25,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:25,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 05:21:25,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:25,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:25,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:25,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:25,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:25,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:25,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:25,455 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:25,455 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:25,456 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 05:21:25,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:25,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:25,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:25,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:21:25,604 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:25,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 05:21:25,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:25,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 05:21:25,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2022-12-06 05:21:25,604 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 05:21:25,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 190041076, now seen corresponding path program 1 times [2022-12-06 05:21:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:25,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898123741] [2022-12-06 05:21:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:25,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:25,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 05:21:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:25,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898123741] [2022-12-06 05:21:25,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898123741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:25,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:25,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953660675] [2022-12-06 05:21:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:25,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:25,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:25,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:25,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 05:21:25,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:25,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:25,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:25,950 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:25,950 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:25,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 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 05:21:25,964 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:25,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:25,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:25,965 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:25,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:25,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:25,999 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:25,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:25,999 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:25,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:25,999 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:26,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:26,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,034 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:26,034 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:26,035 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 05:21:26,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:26,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:26,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:21:26,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:26,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 05:21:26,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:26,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 05:21:26,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2022-12-06 05:21:26,185 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 05:21:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1932851411, now seen corresponding path program 1 times [2022-12-06 05:21:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:26,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072266843] [2022-12-06 05:21:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:26,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072266843] [2022-12-06 05:21:26,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072266843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:26,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:26,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404813073] [2022-12-06 05:21:26,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:26,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:26,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:26,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:26,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:26,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:26,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:26,517 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:26,517 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:26,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 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 05:21:26,531 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:26,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:26,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:26,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 05:21:26,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:26,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 05:21:26,566 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:26,566 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:26,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:26,566 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:26,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:26,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,591 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:26,591 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:26,592 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 05:21:26,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:26,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:26,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:26,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:21:26,748 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:26,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 05:21:26,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:26,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 05:21:26,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2022-12-06 05:21:26,749 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 05:21:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash -619305550, now seen corresponding path program 1 times [2022-12-06 05:21:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:26,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895583765] [2022-12-06 05:21:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:26,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 05:21:26,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:26,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895583765] [2022-12-06 05:21:26,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895583765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:26,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:26,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990233290] [2022-12-06 05:21:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:26,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:26,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:26,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:26,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:26,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 05:21:26,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:26,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:26,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:27,072 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:27,072 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:27,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 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 05:21:27,088 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:27,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:27,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:27,089 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:27,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:27,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:27,120 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,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 05:21:27,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:27,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:27,121 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:27,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:27,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,146 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:27,146 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:27,147 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 05:21:27,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:27,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:27,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:21:27,300 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:27,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 05:21:27,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:27,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 05:21:27,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2022-12-06 05:21:27,300 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 05:21:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1123504785, now seen corresponding path program 1 times [2022-12-06 05:21:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:27,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194682468] [2022-12-06 05:21:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:27,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:27,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 05:21:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:27,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194682468] [2022-12-06 05:21:27,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194682468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:27,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:27,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102637881] [2022-12-06 05:21:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:27,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:27,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:27,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 05:21:27,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:27,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:27,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:27,637 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:27,637 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:21:27,644 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 05:21:27,651 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:27,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:27,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:27,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 05:21:27,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:27,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 05:21:27,683 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,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 05:21:27,684 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:27,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:27,684 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:27,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:27,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,709 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:27,709 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:27,710 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 05:21:27,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:27,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:27,859 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:27,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:27,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:27,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 05:21:27,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:27,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 05:21:27,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2022-12-06 05:21:27,860 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 05:21:27,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1428652176, now seen corresponding path program 1 times [2022-12-06 05:21:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:27,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425081781] [2022-12-06 05:21:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:27,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:27,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 05:21:27,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:27,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425081781] [2022-12-06 05:21:27,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425081781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:27,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:27,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605574931] [2022-12-06 05:21:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:27,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:27,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:27,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 05:21:27,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:27,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:28,193 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:28,193 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:28,199 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 05:21:28,207 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:28,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:28,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:28,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 05:21:28,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:28,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 05:21:28,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,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 05:21:28,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:28,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:28,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:28,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:28,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,266 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:28,266 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:21:28,267 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 05:21:28,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:28,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:28,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:28,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:28,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 05:21:28,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:28,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 05:21:28,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2022-12-06 05:21:28,414 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 05:21:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash 314158159, now seen corresponding path program 1 times [2022-12-06 05:21:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:28,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954477197] [2022-12-06 05:21:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:28,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 05:21:28,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:28,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954477197] [2022-12-06 05:21:28,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954477197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:28,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:28,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078983906] [2022-12-06 05:21:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:28,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:28,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:28,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 05:21:28,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:28,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:28,762 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:28,763 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:28,769 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 05:21:28,775 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:28,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:28,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:28,776 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:28,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:28,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 05:21:28,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,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 05:21:28,805 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:28,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:28,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:28,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:28,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,830 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:28,831 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:28,832 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 05:21:28,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:28,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:28,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:28,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:21:28,972 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:28,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 05:21:28,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:28,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 05:21:28,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2022-12-06 05:21:28,972 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 05:21:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2056968494, now seen corresponding path program 1 times [2022-12-06 05:21:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606674894] [2022-12-06 05:21:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:29,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:29,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606674894] [2022-12-06 05:21:29,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606674894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:29,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:29,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:29,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057960450] [2022-12-06 05:21:29,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:29,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:29,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:29,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:29,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:29,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:29,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:29,291 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:29,292 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:29,306 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:29,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:29,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:29,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 05:21:29,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:29,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:29,340 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:29,340 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:29,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:29,340 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:29,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:29,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,365 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:29,365 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:29,366 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 05:21:29,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:29,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:29,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:29,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:29,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 05:21:29,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:29,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 05:21:29,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2022-12-06 05:21:29,516 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 05:21:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -495188467, now seen corresponding path program 1 times [2022-12-06 05:21:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839332753] [2022-12-06 05:21:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:29,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 05:21:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:29,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839332753] [2022-12-06 05:21:29,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839332753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:29,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:29,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363724610] [2022-12-06 05:21:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:29,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:29,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:29,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 05:21:29,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:29,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:29,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:29,838 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:29,839 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:29,853 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:29,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:29,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:29,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 05:21:29,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:29,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 05:21:29,885 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,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 05:21:29,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:29,886 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:29,886 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:29,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:29,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,918 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:29,918 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:29,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 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 05:21:29,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:29,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:30,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:30,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:21:30,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:30,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 05:21:30,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:30,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 05:21:30,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2022-12-06 05:21:30,071 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 05:21:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1247621868, now seen corresponding path program 1 times [2022-12-06 05:21:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:30,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881419275] [2022-12-06 05:21:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:30,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:30,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881419275] [2022-12-06 05:21:30,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881419275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:30,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:30,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396330339] [2022-12-06 05:21:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:30,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:30,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:30,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:30,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:30,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:30,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:30,406 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:30,406 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:30,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 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 05:21:30,420 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:30,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:30,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:30,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 05:21:30,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:30,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 05:21:30,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:30,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 05:21:30,453 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:30,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:30,453 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:30,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:30,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:30,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:30,485 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:30,485 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:21:30,486 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 05:21:30,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:30,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:30,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:30,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:21:30,630 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:30,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 05:21:30,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:30,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 05:21:30,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2022-12-06 05:21:30,631 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 05:21:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1304535093, now seen corresponding path program 1 times [2022-12-06 05:21:30,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:30,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608489392] [2022-12-06 05:21:30,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:30,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:30,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 05:21:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608489392] [2022-12-06 05:21:30,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608489392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:30,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:30,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621715880] [2022-12-06 05:21:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:30,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:30,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:30,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 05:21:30,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:30,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:30,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:30,973 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:30,973 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:30,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 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 05:21:30,987 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:30,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:30,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:30,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 05:21:30,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:31,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 05:21:31,020 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:31,021 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:31,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:31,021 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:31,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:31,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,046 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:31,046 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:31,047 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 05:21:31,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:31,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:31,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:21:31,199 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:31,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 05:21:31,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:31,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 05:21:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2022-12-06 05:21:31,199 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 05:21:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash 438275242, now seen corresponding path program 1 times [2022-12-06 05:21:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:31,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505014075] [2022-12-06 05:21:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:31,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 05:21:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:31,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505014075] [2022-12-06 05:21:31,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505014075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:31,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:31,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245827016] [2022-12-06 05:21:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:31,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:31,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:31,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:31,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 05:21:31,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:31,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:31,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:31,543 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:31,543 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:31,549 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 05:21:31,557 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:31,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:31,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:31,558 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:31,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:31,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 05:21:31,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,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 05:21:31,590 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:31,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:31,590 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:31,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:31,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,615 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:31,615 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:31,616 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 05:21:31,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:31,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:31,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:31,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:21:31,772 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:31,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:31,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:31,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 05:21:31,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2022-12-06 05:21:31,773 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 05:21:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2113881719, now seen corresponding path program 1 times [2022-12-06 05:21:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:31,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337726681] [2022-12-06 05:21:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337726681] [2022-12-06 05:21:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337726681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:31,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:31,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244307850] [2022-12-06 05:21:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:31,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:31,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:31,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:31,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:31,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:31,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:32,101 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:32,101 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:32,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:32,115 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:32,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:32,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:32,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:32,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 05:21:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:32,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:32,151 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:32,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:32,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:32,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:32,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:32,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,176 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:32,176 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:32,177 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 05:21:32,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:32,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:32,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:21:32,329 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:32,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:32,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:32,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:32,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2022-12-06 05:21:32,329 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 05:21:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:32,330 INFO L85 PathProgramCache]: Analyzing trace with hash -371071384, now seen corresponding path program 1 times [2022-12-06 05:21:32,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:32,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800498947] [2022-12-06 05:21:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:32,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 05:21:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800498947] [2022-12-06 05:21:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800498947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:32,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:32,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746267955] [2022-12-06 05:21:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:32,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:32,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:32,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 05:21:32,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:32,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:32,662 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:32,662 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:32,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:32,676 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:32,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:32,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:32,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 05:21:32,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:32,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 05:21:32,710 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,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 05:21:32,710 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:32,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:32,710 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:32,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:32,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,735 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:32,735 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:21:32,736 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 05:21:32,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:32,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:32,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:32,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:21:32,878 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:32,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:32,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:32,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:32,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2022-12-06 05:21:32,878 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 05:21:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1371738951, now seen corresponding path program 1 times [2022-12-06 05:21:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:32,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414463055] [2022-12-06 05:21:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:32,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:32,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414463055] [2022-12-06 05:21:32,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414463055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:32,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:32,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:32,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776088845] [2022-12-06 05:21:32,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:32,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:32,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:32,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:32,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:32,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:32,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:32,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:32,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:33,224 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:33,224 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:33,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 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 05:21:33,239 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:33,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:33,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:33,240 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:33,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:33,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 05:21:33,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,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 05:21:33,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:33,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:33,273 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:33,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:33,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,298 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:33,298 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:21:33,299 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 05:21:33,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:33,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:33,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:21:33,468 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:33,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:33,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:33,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:33,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2022-12-06 05:21:33,468 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 05:21:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1180418010, now seen corresponding path program 1 times [2022-12-06 05:21:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:33,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124075488] [2022-12-06 05:21:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:33,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 05:21:33,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:33,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124075488] [2022-12-06 05:21:33,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124075488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:33,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:33,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770650647] [2022-12-06 05:21:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:33,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:33,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:33,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:33,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:33,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 05:21:33,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:33,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:33,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:33,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:33,827 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:33,833 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 05:21:33,838 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:33,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:33,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:33,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 05:21:33,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:33,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 05:21:33,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,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 05:21:33,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:33,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:33,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:33,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:33,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:33,893 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:21:33,894 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 05:21:33,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:33,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:34,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:34,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:34,043 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:34,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 05:21:34,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:34,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 05:21:34,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2022-12-06 05:21:34,044 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 05:21:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 562392325, now seen corresponding path program 1 times [2022-12-06 05:21:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:34,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510760117] [2022-12-06 05:21:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:34,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:34,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510760117] [2022-12-06 05:21:34,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510760117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:34,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:34,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245095672] [2022-12-06 05:21:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:34,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:34,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:34,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:34,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:34,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:34,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:34,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:34,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:34,375 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:34,382 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 05:21:34,390 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:34,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:34,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:34,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 05:21:34,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:34,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:34,424 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:34,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:34,424 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:34,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:34,424 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:34,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:34,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:34,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:34,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:34,449 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:34,449 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:34,450 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 05:21:34,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:34,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:34,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:34,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:34,600 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:34,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:34,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:34,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 05:21:34,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2022-12-06 05:21:34,601 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 05:21:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1989764636, now seen corresponding path program 1 times [2022-12-06 05:21:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:34,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883395687] [2022-12-06 05:21:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:34,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 05:21:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883395687] [2022-12-06 05:21:34,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883395687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:34,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:34,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254684584] [2022-12-06 05:21:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:34,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:34,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:34,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 05:21:34,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:34,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:34,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:34,968 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:34,968 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:34,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:34,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:34,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:34,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:34,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 05:21:34,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:35,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 05:21:35,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,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 05:21:35,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:35,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:35,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:35,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:35,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,036 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:35,036 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:21:35,037 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 05:21:35,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:35,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:35,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:35,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:35,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 05:21:35,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:35,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 05:21:35,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2022-12-06 05:21:35,185 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 05:21:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash -246954301, now seen corresponding path program 1 times [2022-12-06 05:21:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:35,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054357294] [2022-12-06 05:21:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:35,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 05:21:35,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054357294] [2022-12-06 05:21:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054357294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:35,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:35,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369142592] [2022-12-06 05:21:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:35,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:35,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:35,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:35,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 05:21:35,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:35,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:35,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:35,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:35,511 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:35,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 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 05:21:35,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:35,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:35,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:35,527 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:35,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:35,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 05:21:35,561 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:35,561 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:35,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:35,561 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,561 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:35,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:35,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,586 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:35,586 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:21:35,587 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 05:21:35,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:35,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:35,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:35,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:21:35,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21: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 05:21:35,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:35,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 05:21:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2022-12-06 05:21:35,744 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 05:21:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1495856034, now seen corresponding path program 1 times [2022-12-06 05:21:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:35,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352688686] [2022-12-06 05:21:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:35,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352688686] [2022-12-06 05:21:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352688686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:35,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:35,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290774976] [2022-12-06 05:21:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:35,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:35,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:35,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:35,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:35,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:35,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:36,110 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:36,110 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:36,118 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 05:21:36,125 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:36,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:36,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:36,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 05:21:36,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:36,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 05:21:36,160 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,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 05:21:36,161 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:36,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:36,161 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:36,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:36,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,186 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:36,186 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:36,187 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 05:21:36,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:36,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:36,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 05:21:36,364 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:36,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 05:21:36,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:36,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 05:21:36,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2022-12-06 05:21:36,365 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 05:21:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1056300927, now seen corresponding path program 1 times [2022-12-06 05:21:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:36,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700186775] [2022-12-06 05:21:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:36,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 05:21:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:36,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700186775] [2022-12-06 05:21:36,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700186775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:36,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:36,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322788441] [2022-12-06 05:21:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:36,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:36,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:36,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:36,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:36,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 05:21:36,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:36,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:36,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:36,709 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:36,710 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:36,717 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 05:21:36,725 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:36,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:36,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:36,726 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:36,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:36,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 05:21:36,759 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,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 05:21:36,759 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:36,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:36,759 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:36,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:36,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,784 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:36,784 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:36,785 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 05:21:36,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:36,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:36,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:36,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:21:36,926 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:36,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 05:21:36,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:36,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 05:21:36,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2022-12-06 05:21:36,926 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 05:21:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash 686509408, now seen corresponding path program 1 times [2022-12-06 05:21:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:36,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936132736] [2022-12-06 05:21:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:36,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936132736] [2022-12-06 05:21:36,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936132736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:36,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:36,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:36,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244504807] [2022-12-06 05:21:36,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:36,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:36,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:36,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 05:21:36,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:36,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:36,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:37,286 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:37,286 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:37,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 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 05:21:37,301 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:37,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:37,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:37,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 05:21:37,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:37,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 05:21:37,333 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:37,333 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:37,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:37,333 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:37,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:37,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,360 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:37,360 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:21:37,361 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 05:21:37,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:37,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:37,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:21:37,517 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:37,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 05:21:37,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:37,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 05:21:37,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2022-12-06 05:21:37,517 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 05:21:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1865647553, now seen corresponding path program 1 times [2022-12-06 05:21:37,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:37,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556617587] [2022-12-06 05:21:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:37,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 05:21:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556617587] [2022-12-06 05:21:37,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556617587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:37,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:37,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228886143] [2022-12-06 05:21:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:37,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:37,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:37,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 05:21:37,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:37,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:37,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:37,864 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:37,864 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:37,871 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 05:21:37,878 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:37,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:37,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:37,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 05:21:37,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:37,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 05:21:37,910 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,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 05:21:37,910 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:37,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:37,910 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:37,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:37,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,935 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:37,935 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:37,936 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 05:21:37,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:37,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:38,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:38,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:21:38,090 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:38,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 05:21:38,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:38,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 05:21:38,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2022-12-06 05:21:38,090 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 05:21:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash -122837218, now seen corresponding path program 1 times [2022-12-06 05:21:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:38,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441860078] [2022-12-06 05:21:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:38,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 05:21:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:38,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441860078] [2022-12-06 05:21:38,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441860078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:38,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:38,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086677902] [2022-12-06 05:21:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:38,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:38,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:38,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:38,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 05:21:38,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:38,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:38,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:38,441 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:38,441 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:38,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 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 05:21:38,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:38,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:38,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:38,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 05:21:38,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:38,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 05:21:38,489 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:38,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 05:21:38,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:38,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:38,490 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:38,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:38,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:38,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:38,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:38,514 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:38,515 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:21:38,516 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 05:21:38,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:38,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:38,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:38,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:21:38,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:38,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 05:21:38,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:38,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 05:21:38,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2022-12-06 05:21:38,661 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 05:21:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1619973117, now seen corresponding path program 1 times [2022-12-06 05:21:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:38,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292811555] [2022-12-06 05:21:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:38,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 05:21:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:38,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292811555] [2022-12-06 05:21:38,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292811555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:38,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:38,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401171065] [2022-12-06 05:21:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:38,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:38,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:38,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 05:21:38,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:38,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:39,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:39,037 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:39,044 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 05:21:39,050 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:39,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:39,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:39,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 05:21:39,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:39,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 05:21:39,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,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 05:21:39,082 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:39,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:39,082 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:39,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:39,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,106 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:39,106 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:39,107 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 05:21:39,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:39,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:39,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:21:39,250 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:39,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 05:21:39,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:39,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 05:21:39,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2022-12-06 05:21:39,250 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 05:21:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash -932183844, now seen corresponding path program 1 times [2022-12-06 05:21:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:39,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098823194] [2022-12-06 05:21:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:39,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:39,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098823194] [2022-12-06 05:21:39,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098823194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:39,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:39,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094288439] [2022-12-06 05:21:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:39,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:39,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:39,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:39,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:39,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:39,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:39,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:39,593 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:39,593 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:39,600 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 05:21:39,607 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:39,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:39,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:39,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 05:21:39,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:39,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 05:21:39,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:39,642 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:39,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:39,642 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:39,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:39,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,667 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:39,667 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:21:39,668 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 05:21:39,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:39,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:39,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:39,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:39,818 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:39,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:39,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:39,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:39,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2022-12-06 05:21:39,818 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 05:21:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 810626491, now seen corresponding path program 1 times [2022-12-06 05:21:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:39,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183949332] [2022-12-06 05:21:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:39,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 05:21:39,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183949332] [2022-12-06 05:21:39,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183949332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:39,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:39,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454371158] [2022-12-06 05:21:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:39,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:39,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:39,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:39,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 05:21:39,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:39,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:39,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:40,184 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:40,184 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:40,190 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 05:21:40,196 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:40,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:40,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:40,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 05:21:40,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:40,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 05:21:40,225 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:40,225 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:40,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:40,226 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,226 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:40,226 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:40,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,250 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:40,250 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:40,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 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 05:21:40,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:40,395 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:40,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:21:40,396 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:40,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 05:21:40,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:40,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 05:21:40,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2022-12-06 05:21:40,396 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 05:21:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1741530470, now seen corresponding path program 1 times [2022-12-06 05:21:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:40,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344332655] [2022-12-06 05:21:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:40,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 05:21:40,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:40,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344332655] [2022-12-06 05:21:40,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344332655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:40,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:40,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596682555] [2022-12-06 05:21:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:40,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:40,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:40,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 05:21:40,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:40,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:40,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:40,719 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:40,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:40,733 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:40,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:40,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:40,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 05:21:40,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:40,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 05:21:40,765 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,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 05:21:40,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:40,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:40,765 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:40,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:40,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,790 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:40,790 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:40,791 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 05:21:40,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:40,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:40,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:40,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:21:40,941 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:40,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 05:21:40,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:40,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 05:21:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2022-12-06 05:21:40,941 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 05:21:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1279865, now seen corresponding path program 1 times [2022-12-06 05:21:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:40,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066200712] [2022-12-06 05:21:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:41,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 05:21:41,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:41,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066200712] [2022-12-06 05:21:41,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066200712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:41,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:41,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:41,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147120816] [2022-12-06 05:21:41,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:41,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:41,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:41,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:41,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:41,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 05:21:41,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:41,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:41,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:41,281 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:41,281 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:41,288 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 05:21:41,295 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:41,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:41,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:41,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 05:21:41,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:41,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 05:21:41,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,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 05:21:41,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:41,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:41,355 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:41,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:41,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,379 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:41,380 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:21:41,381 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 05:21:41,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:41,542 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:41,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:21:41,542 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:41,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:41,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2022-12-06 05:21:41,543 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 05:21:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:41,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1744090200, now seen corresponding path program 1 times [2022-12-06 05:21:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:41,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607989375] [2022-12-06 05:21:41,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:41,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:41,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 05:21:41,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:41,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607989375] [2022-12-06 05:21:41,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607989375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:41,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:41,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214832570] [2022-12-06 05:21:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:41,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:41,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:41,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:41,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:41,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:41,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 05:21:41,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:41,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:41,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:41,884 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:41,884 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:21:41,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 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 05:21:41,898 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:41,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:41,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:41,899 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:41,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:41,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:41,934 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:41,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:41,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:41,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:41,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:41,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,959 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:41,960 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:21:41,961 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 05:21:41,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:41,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:42,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:42,112 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:21:42,112 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:42,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 05:21:42,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:42,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 05:21:42,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2022-12-06 05:21:42,112 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 05:21:42,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -808066761, now seen corresponding path program 1 times [2022-12-06 05:21:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:42,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362238854] [2022-12-06 05:21:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:42,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 05:21:42,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:42,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362238854] [2022-12-06 05:21:42,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362238854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:42,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:42,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064669410] [2022-12-06 05:21:42,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:42,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:42,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:42,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:42,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:42,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:42,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:42,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:42,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:42,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:42,436 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:42,436 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:42,443 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 05:21:42,450 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:42,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:42,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:42,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 05:21:42,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:42,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 05:21:42,484 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:42,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:42,484 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:42,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:42,484 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:42,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:42,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:42,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:42,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:42,509 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:42,509 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:21:42,510 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 05:21:42,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:42,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:42,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:42,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:21:42,675 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:42,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 05:21:42,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:42,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 05:21:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2022-12-06 05:21:42,675 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 05:21:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 934743574, now seen corresponding path program 1 times [2022-12-06 05:21:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323409996] [2022-12-06 05:21:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:42,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323409996] [2022-12-06 05:21:42,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323409996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:42,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:42,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645528796] [2022-12-06 05:21:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:42,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:42,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:42,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:42,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:42,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:43,011 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:43,011 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:43,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 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 05:21:43,025 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:43,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:43,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:43,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 05:21:43,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:43,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 05:21:43,060 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,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 05:21:43,061 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:43,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:43,061 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:43,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:43,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,086 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:43,086 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:21:43,087 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 05:21:43,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:43,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:43,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 05:21:43,261 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:43,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 05:21:43,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:43,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 05:21:43,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2022-12-06 05:21:43,261 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 05:21:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1617413387, now seen corresponding path program 1 times [2022-12-06 05:21:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:43,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552837169] [2022-12-06 05:21:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:43,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 05:21:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:43,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552837169] [2022-12-06 05:21:43,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552837169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:43,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:43,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742255353] [2022-12-06 05:21:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:43,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:43,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:43,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:43,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:43,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 05:21:43,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:43,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:43,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:43,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:43,587 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:43,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 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 05:21:43,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:43,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:43,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:43,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 05:21:43,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:43,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 05:21:43,635 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,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 05:21:43,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:43,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:43,636 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:43,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:43,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,661 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:43,661 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:21:43,662 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 05:21:43,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:43,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:43,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:43,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:21:43,808 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:43,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:43,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 05:21:43,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2022-12-06 05:21:43,808 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 05:21:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 125396948, now seen corresponding path program 1 times [2022-12-06 05:21:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580985626] [2022-12-06 05:21:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:43,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 05:21:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:43,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580985626] [2022-12-06 05:21:43,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580985626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:43,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:43,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730978064] [2022-12-06 05:21:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:43,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:43,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:43,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:43,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:43,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 05:21:43,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:43,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:43,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:44,143 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:44,143 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:44,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 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 05:21:44,158 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:44,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:44,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:44,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 05:21:44,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:44,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 05:21:44,191 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,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 05:21:44,191 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:44,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:44,191 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:44,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:44,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,216 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:44,216 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:44,217 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 05:21:44,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:44,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:44,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:21:44,365 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:44,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 05:21:44,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:44,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 05:21:44,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2022-12-06 05:21:44,366 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 05:21:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1868207283, now seen corresponding path program 1 times [2022-12-06 05:21:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:44,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601502661] [2022-12-06 05:21:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:44,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 05:21:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:44,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601502661] [2022-12-06 05:21:44,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601502661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:44,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:44,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:44,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923272017] [2022-12-06 05:21:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:44,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:44,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:44,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:44,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 05:21:44,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:44,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:44,698 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:44,698 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:44,705 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 05:21:44,713 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:44,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:44,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:44,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 05:21:44,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:44,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 05:21:44,748 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,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 05:21:44,748 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:44,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:44,748 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:44,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:44,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,773 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:44,774 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:21:44,775 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 05:21:44,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:44,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:44,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:44,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:21:44,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:44,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 05:21:44,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:44,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 05:21:44,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2022-12-06 05:21:44,928 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 05:21:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash -683949678, now seen corresponding path program 1 times [2022-12-06 05:21:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616387749] [2022-12-06 05:21:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:44,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 05:21:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:44,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616387749] [2022-12-06 05:21:44,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616387749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:44,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:44,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500206370] [2022-12-06 05:21:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:44,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:44,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 05:21:44,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:44,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:44,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:45,269 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:45,269 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:45,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 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 05:21:45,282 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:45,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:45,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21: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 05:21:45,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:45,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 05:21:45,313 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,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 05:21:45,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:45,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:45,314 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:45,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:45,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,338 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:45,338 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:45,339 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 05:21:45,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:45,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:45,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:21:45,503 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:45,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 05:21:45,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:45,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 05:21:45,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2022-12-06 05:21:45,503 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 05:21:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1058860657, now seen corresponding path program 1 times [2022-12-06 05:21:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:45,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519072726] [2022-12-06 05:21:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:45,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:45,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 05:21:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:45,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519072726] [2022-12-06 05:21:45,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519072726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:45,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:45,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153380067] [2022-12-06 05:21:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:45,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:45,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:45,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:45,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:45,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 05:21:45,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:45,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:45,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:45,850 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:45,851 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:45,858 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 05:21:45,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:45,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:45,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:45,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 05:21:45,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:45,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:45,899 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,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 05:21:45,899 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:45,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:45,899 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:45,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:45,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,924 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:45,924 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:45,925 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 05:21:45,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:45,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:46,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:46,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:46,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21: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 05:21:46,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21: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 05:21:46,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2022-12-06 05:21:46,074 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 05:21:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1493296304, now seen corresponding path program 1 times [2022-12-06 05:21:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:46,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000680004] [2022-12-06 05:21:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:46,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 05:21:46,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:46,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000680004] [2022-12-06 05:21:46,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000680004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:46,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:46,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:46,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966474399] [2022-12-06 05:21:46,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:46,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:46,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:46,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:46,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 05:21:46,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:46,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:46,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:46,576 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:46,576 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:46,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 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 05:21:46,588 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:46,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:46,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:46,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 05:21:46,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:46,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 05:21:46,617 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:46,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 05:21:46,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:46,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:46,618 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:46,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:46,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:46,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:46,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:46,644 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:46,644 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:21:46,645 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 05:21:46,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:46,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:46,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:46,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:21:46,800 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:46,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:46,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:46,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:46,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2022-12-06 05:21:46,800 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 05:21:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash 249514031, now seen corresponding path program 1 times [2022-12-06 05:21:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:46,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655081759] [2022-12-06 05:21:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:46,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:46,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655081759] [2022-12-06 05:21:46,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655081759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:46,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:46,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591400731] [2022-12-06 05:21:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:46,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:46,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:46,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:46,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 05:21:46,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:46,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:47,133 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:47,133 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:47,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 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 05:21:47,147 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:47,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:47,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:47,148 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:47,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:47,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:47,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:47,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:47,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:47,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:47,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:47,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,209 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:47,209 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:21:47,210 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 05:21:47,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:47,355 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:47,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:47,356 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:47,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 05:21:47,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:47,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 05:21:47,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2022-12-06 05:21:47,356 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 05:21:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1992324366, now seen corresponding path program 1 times [2022-12-06 05:21:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:47,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552661143] [2022-12-06 05:21:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552661143] [2022-12-06 05:21:47,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552661143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:47,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:47,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752718163] [2022-12-06 05:21:47,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:47,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:47,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:47,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:47,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:47,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:47,700 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:47,700 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:47,707 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 05:21:47,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:47,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:47,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:47,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 05:21:47,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:47,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:47,749 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:47,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:47,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:47,749 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:47,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:47,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,781 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:47,781 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:47,782 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 05:21:47,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:47,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:47,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:47,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:21:47,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:47,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 05:21:47,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:47,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 05:21:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2022-12-06 05:21:47,936 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 05:21:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -559832595, now seen corresponding path program 1 times [2022-12-06 05:21:47,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:47,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443664237] [2022-12-06 05:21:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:47,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:47,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 05:21:47,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:47,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443664237] [2022-12-06 05:21:47,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443664237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:47,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:47,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656915093] [2022-12-06 05:21:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:47,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:47,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:47,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:47,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 05:21:47,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:47,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:47,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:48,258 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:48,259 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:48,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 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 05:21:48,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:48,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:48,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:48,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 05:21:48,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:48,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 05:21:48,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,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 05:21:48,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:48,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:48,306 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:48,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:48,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,331 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:48,331 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:21:48,332 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 05:21:48,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:48,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:48,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:48,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:48,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 05:21:48,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:48,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 05:21:48,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2022-12-06 05:21:48,481 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 05:21:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1182977740, now seen corresponding path program 1 times [2022-12-06 05:21:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:48,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691402432] [2022-12-06 05:21:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:48,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691402432] [2022-12-06 05:21:48,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691402432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:48,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:48,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656446807] [2022-12-06 05:21:48,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:48,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:48,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:48,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:48,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:48,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:48,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:48,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:48,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:48,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:48,814 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:48,814 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:48,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:48,829 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:48,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:48,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:48,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 05:21:48,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:48,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 05:21:48,864 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,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 05:21:48,865 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:48,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:48,865 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:48,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:48,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,890 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:48,890 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:21:48,891 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 05:21:48,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:48,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:49,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:49,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:49,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:49,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 05:21:49,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:49,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 05:21:49,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2022-12-06 05:21:49,038 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 05:21:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1369179221, now seen corresponding path program 1 times [2022-12-06 05:21:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756188982] [2022-12-06 05:21:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:49,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 05:21:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:49,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756188982] [2022-12-06 05:21:49,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756188982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:49,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:49,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817630934] [2022-12-06 05:21:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:49,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:49,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:49,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 05:21:49,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:49,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:49,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:49,378 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:49,378 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:49,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 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 05:21:49,393 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:49,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:49,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:49,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 05:21:49,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:49,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 05:21:49,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:49,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 05:21:49,431 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:49,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:49,431 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:49,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:49,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:49,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:49,456 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:49,456 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:21:49,457 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 05:21:49,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:49,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:49,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:49,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:21:49,609 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:49,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:49,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:49,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2022-12-06 05:21:49,609 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 05:21:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash 373631114, now seen corresponding path program 1 times [2022-12-06 05:21:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:49,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445528774] [2022-12-06 05:21:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:49,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 05:21:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:49,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445528774] [2022-12-06 05:21:49,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445528774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:49,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:49,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988094302] [2022-12-06 05:21:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:49,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:49,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:49,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 05:21:49,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:49,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:49,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:49,965 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:49,965 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:49,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 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 05:21:49,980 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:49,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:49,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:49,981 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:49,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:50,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:50,016 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:50,016 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:50,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:50,017 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:50,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:50,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,042 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:50,042 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:50,043 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 05:21:50,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:50,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:50,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:21:50,186 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:50,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 05:21:50,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:50,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 05:21:50,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2022-12-06 05:21:50,187 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 05:21:50,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2116441449, now seen corresponding path program 1 times [2022-12-06 05:21:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:50,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793736893] [2022-12-06 05:21:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:50,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 05:21:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793736893] [2022-12-06 05:21:50,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793736893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:50,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:50,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853889963] [2022-12-06 05:21:50,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:50,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:50,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:50,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:50,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:50,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 05:21:50,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:50,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:50,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:50,542 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:50,542 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:50,549 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 05:21:50,556 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:50,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:50,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:50,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 05:21:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:50,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 05:21:50,588 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,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 05:21:50,589 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:50,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:50,589 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:50,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:50,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,614 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:50,614 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:50,615 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 05:21:50,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:50,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:50,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:50,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:21:50,774 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:50,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 05:21:50,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:50,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 05:21:50,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2022-12-06 05:21:50,774 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 05:21:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash -435715512, now seen corresponding path program 1 times [2022-12-06 05:21:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:50,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496339245] [2022-12-06 05:21:50,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:50,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 05:21:50,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496339245] [2022-12-06 05:21:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496339245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:50,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943371921] [2022-12-06 05:21:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:50,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:50,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:50,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:50,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 05:21:50,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:50,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:50,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:51,124 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:51,124 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:51,131 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 05:21:51,138 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:51,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:51,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:51,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 05:21:51,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:51,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 05:21:51,171 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,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 05:21:51,172 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:51,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:51,172 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:51,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:51,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,201 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:51,201 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:21:51,202 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 05:21:51,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:51,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:51,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:21:51,362 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:51,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:51,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:51,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:51,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2022-12-06 05:21:51,362 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 05:21:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1307094823, now seen corresponding path program 1 times [2022-12-06 05:21:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:51,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509632250] [2022-12-06 05:21:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:51,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 05:21:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509632250] [2022-12-06 05:21:51,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509632250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:51,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:51,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817114389] [2022-12-06 05:21:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:51,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:51,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:51,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 05:21:51,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:51,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:51,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:51,727 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:51,727 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:51,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:51,740 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:51,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:51,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:51,741 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:51,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:51,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 05:21:51,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,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 05:21:51,771 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:51,771 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:51,771 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:51,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:51,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,805 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:51,806 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:21:51,807 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 05:21:51,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:51,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:51,959 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:51,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:21:51,960 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:51,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 05:21:51,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:51,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:51,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2022-12-06 05:21:51,960 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 05:21:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1245062138, now seen corresponding path program 1 times [2022-12-06 05:21:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:51,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157742305] [2022-12-06 05:21:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:52,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 05:21:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:52,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157742305] [2022-12-06 05:21:52,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157742305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:52,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:52,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275308014] [2022-12-06 05:21:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:52,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:52,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:52,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:52,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 05:21:52,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:52,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:52,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:52,290 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:52,297 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 05:21:52,305 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:52,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:52,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:52,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 05:21:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:52,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:52,341 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,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 05:21:52,342 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:52,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:52,342 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:52,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:52,343 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,369 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:52,369 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:52,370 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 05:21:52,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:52,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:52,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:52,515 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:52,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 05:21:52,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:52,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 05:21:52,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2022-12-06 05:21:52,516 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 05:21:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 497748197, now seen corresponding path program 1 times [2022-12-06 05:21:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:52,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212074244] [2022-12-06 05:21:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21: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 05:21:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:52,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212074244] [2022-12-06 05:21:52,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212074244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:52,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:52,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440519769] [2022-12-06 05:21:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:52,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:52,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:52,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:52,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21: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 05:21:52,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:52,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:52,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:52,898 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:52,898 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:52,904 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 05:21:52,909 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:52,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:52,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:52,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 05:21:52,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:52,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 05:21:52,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,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 05:21:52,940 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:52,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:52,940 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:52,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:52,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,965 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:52,965 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:52,966 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 05:21:52,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:52,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:53,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:53,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:21:53,121 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:53,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 05:21:53,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:53,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 05:21:53,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2022-12-06 05:21:53,122 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 05:21:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2054408764, now seen corresponding path program 1 times [2022-12-06 05:21:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:53,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975485132] [2022-12-06 05:21:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:53,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:53,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975485132] [2022-12-06 05:21:53,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975485132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:53,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:53,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346641754] [2022-12-06 05:21:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:53,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:53,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:53,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:53,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:53,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:53,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:53,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:53,467 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:53,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:53,481 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:53,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:53,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:53,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 05:21:53,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:53,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 05:21:53,516 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:53,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 05:21:53,516 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:53,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:53,516 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:53,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:53,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:53,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:53,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:53,541 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:53,542 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:21:53,542 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 05:21:53,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:53,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:53,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:53,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:21:53,690 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:53,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 05:21:53,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:53,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 05:21:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2022-12-06 05:21:53,690 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 05:21:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -311598429, now seen corresponding path program 1 times [2022-12-06 05:21:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:53,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430848379] [2022-12-06 05:21:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:53,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430848379] [2022-12-06 05:21:53,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430848379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:53,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:53,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84763649] [2022-12-06 05:21:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:53,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:53,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:53,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:53,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 05:21:53,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:53,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:54,019 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:54,020 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:21:54,026 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 05:21:54,034 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:54,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:54,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:54,035 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:54,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:54,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:54,068 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:54,068 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:54,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:54,068 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:54,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:54,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,102 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:54,103 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:21:54,104 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 05:21:54,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:54,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:54,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:21:54,252 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:54,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 05:21:54,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:54,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 05:21:54,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2022-12-06 05:21:54,252 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 05:21:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1431211906, now seen corresponding path program 1 times [2022-12-06 05:21:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:54,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085823103] [2022-12-06 05:21:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:54,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085823103] [2022-12-06 05:21:54,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085823103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:54,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:54,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480098574] [2022-12-06 05:21:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:54,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:54,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:54,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:54,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 05:21:54,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:54,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:54,598 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:54,598 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:21:54,605 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 05:21:54,612 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:54,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:54,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:54,620 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:54,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:54,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 05:21:54,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,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 05:21:54,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:54,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:54,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:54,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:54,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,683 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:54,683 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:21:54,684 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 05:21:54,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:54,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:54,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:54,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:21:54,840 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:54,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 05:21:54,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:54,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 05:21:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2022-12-06 05:21:54,840 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 05:21:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1120945055, now seen corresponding path program 1 times [2022-12-06 05:21:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:54,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046831626] [2022-12-06 05:21:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:54,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 05:21:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046831626] [2022-12-06 05:21:54,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046831626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:54,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:54,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142546415] [2022-12-06 05:21:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:54,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:54,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:54,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:54,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 05:21:54,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:54,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:54,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:55,179 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:55,179 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:55,186 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 05:21:55,193 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:55,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:55,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:55,194 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:55,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:55,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 05:21:55,229 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:55,229 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:55,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:55,229 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:55,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:55,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,254 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:55,254 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:55,255 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 05:21:55,257 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,257 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:55,415 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:55,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:21:55,415 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:55,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 05:21:55,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:55,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 05:21:55,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2022-12-06 05:21:55,416 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 05:21:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash 621865280, now seen corresponding path program 1 times [2022-12-06 05:21:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:55,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878469233] [2022-12-06 05:21:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:55,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:55,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878469233] [2022-12-06 05:21:55,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878469233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:55,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:55,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:55,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249873198] [2022-12-06 05:21:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:55,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:55,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:55,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:55,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:55,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:55,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:55,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:55,767 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:55,767 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:21:55,774 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 05:21:55,782 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:55,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:55,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:55,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 05:21:55,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:55,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 05:21:55,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,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 05:21:55,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:55,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:55,814 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:55,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:55,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,838 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:55,839 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:21:55,840 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 05:21:55,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:55,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:55,992 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:55,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:21:55,993 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:55,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:55,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:55,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2022-12-06 05:21:55,993 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 05:21:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1930291681, now seen corresponding path program 1 times [2022-12-06 05:21:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223573884] [2022-12-06 05:21:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:56,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223573884] [2022-12-06 05:21:56,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223573884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:56,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:56,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124905484] [2022-12-06 05:21:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:56,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:56,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 05:21:56,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:56,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:56,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:56,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:56,318 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:56,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:21:56,332 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:56,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:56,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:56,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 05:21:56,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:56,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 05:21:56,365 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,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 05:21:56,365 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:56,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:56,365 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:56,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:56,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,390 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:56,390 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:21:56,391 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 05:21:56,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:56,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:56,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:21:56,538 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:56,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:56,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:56,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:56,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2022-12-06 05:21:56,538 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 05:21:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash -187481346, now seen corresponding path program 1 times [2022-12-06 05:21:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:56,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780405458] [2022-12-06 05:21:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:56,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 05:21:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:56,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780405458] [2022-12-06 05:21:56,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780405458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:56,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:56,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372533284] [2022-12-06 05:21:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:56,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:56,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:56,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:56,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:56,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:56,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:56,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:56,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:56,882 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:56,883 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:56,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 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 05:21:56,896 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:56,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:56,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:56,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 05:21:56,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:56,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 05:21:56,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,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 05:21:56,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:56,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:56,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:56,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:56,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:56,953 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:21:56,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 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 05:21:56,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:56,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:57,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:57,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:21:57,110 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:57,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:57,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:57,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:57,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2022-12-06 05:21:57,111 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 05:21:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1555328989, now seen corresponding path program 1 times [2022-12-06 05:21:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:57,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820552002] [2022-12-06 05:21:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:57,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 05:21:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820552002] [2022-12-06 05:21:57,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820552002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:57,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:57,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345549746] [2022-12-06 05:21:57,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:57,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:57,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:57,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:57,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 05:21:57,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:57,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:57,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:57,434 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:57,434 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:21:57,443 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 05:21:57,451 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:57,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:57,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:57,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 05:21:57,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:57,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 05:21:57,485 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:57,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 05:21:57,485 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:57,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:57,485 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:57,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:57,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:57,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:57,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:57,510 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:57,511 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:21:57,512 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 05:21:57,513 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:57,513 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:57,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:57,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:21:57,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:57,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 05:21:57,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:57,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 05:21:57,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2022-12-06 05:21:57,679 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 05:21:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -996827972, now seen corresponding path program 1 times [2022-12-06 05:21:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128557979] [2022-12-06 05:21:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:57,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 05:21:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:57,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128557979] [2022-12-06 05:21:57,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128557979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:57,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:57,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620803325] [2022-12-06 05:21:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:57,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:57,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:57,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 05:21:57,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:57,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:57,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:58,041 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:58,041 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:21:58,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:21:58,053 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:58,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:58,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:58,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 05:21:58,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:58,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:21:58,082 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:21:58,083 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:58,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:58,083 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:58,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:58,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,107 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:21:58,108 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:21:58,109 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 05:21:58,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:58,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:58,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:21:58,260 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:58,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 05:21:58,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:58,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 05:21:58,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2022-12-06 05:21:58,260 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 05:21:58,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash 745982363, now seen corresponding path program 1 times [2022-12-06 05:21:58,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:58,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578450491] [2022-12-06 05:21:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:58,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 05:21:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:58,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578450491] [2022-12-06 05:21:58,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578450491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:58,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:58,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915281674] [2022-12-06 05:21:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:58,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:58,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:58,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 05:21:58,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:58,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:58,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:58,593 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:58,593 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:58,600 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 05:21:58,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:58,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:58,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:58,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 05:21:58,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:58,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 05:21:58,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,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 05:21:58,642 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:58,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:58,642 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:58,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:58,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,668 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:58,668 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:21:58,669 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 05:21:58,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:58,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:58,816 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:58,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:21:58,817 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:58,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:58,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:58,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:58,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2022-12-06 05:21:58,817 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 05:21:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1806174598, now seen corresponding path program 1 times [2022-12-06 05:21:58,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:58,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818576276] [2022-12-06 05:21:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:58,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818576276] [2022-12-06 05:21:58,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818576276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:58,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:58,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496747714] [2022-12-06 05:21:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:58,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:58,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:21:58,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:58,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:58,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:59,151 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:59,151 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:21:59,158 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 05:21:59,165 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:59,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:59,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:59,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 05:21:59,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:59,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 05:21:59,199 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,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 05:21:59,200 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:59,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:59,200 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:59,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:59,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,231 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:59,231 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:21:59,232 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 05:21:59,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:21:59,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:59,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:21:59,374 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:21:59,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 05:21:59,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:59,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 05:21:59,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2022-12-06 05:21:59,374 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 05:21:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -63364263, now seen corresponding path program 1 times [2022-12-06 05:21:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:59,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461059392] [2022-12-06 05:21:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:59,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 05:21:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461059392] [2022-12-06 05:21:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461059392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:59,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:59,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435907893] [2022-12-06 05:21:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:59,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:59,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:59,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:59,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:59,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:21:59,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 05:21:59,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:59,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:21:59,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:59,834 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:21:59,834 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:21:59,841 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 05:21:59,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:21:59,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:21:59,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:21:59,849 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:21:59,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:21:59,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 05:21:59,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,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 05:21:59,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:21:59,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:59,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:59,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:59,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,910 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:21:59,910 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:21:59,911 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 05:21:59,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:21:59,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:00,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:00,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:22:00,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:00,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 05:22:00,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:00,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:00,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2022-12-06 05:22:00,070 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 05:22:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1679446072, now seen corresponding path program 1 times [2022-12-06 05:22:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:00,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629621167] [2022-12-06 05:22:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:00,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629621167] [2022-12-06 05:22:00,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629621167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:00,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:00,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942702684] [2022-12-06 05:22:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:00,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:00,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:00,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:00,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:00,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:00,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:00,415 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:00,415 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:00,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 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 05:22:00,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:00,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:00,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:00,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 05:22:00,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:00,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 05:22:00,467 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:00,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:00,467 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:00,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:00,467 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:00,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:00,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:00,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:00,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:00,492 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:00,492 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:22:00,493 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 05:22:00,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:00,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:00,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:00,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:22:00,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:00,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:00,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:00,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2022-12-06 05:22:00,647 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 05:22:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash -872710889, now seen corresponding path program 1 times [2022-12-06 05:22:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:00,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269939893] [2022-12-06 05:22:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:00,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 05:22:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:00,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269939893] [2022-12-06 05:22:00,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269939893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:00,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:00,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260929355] [2022-12-06 05:22:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:00,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:00,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 05:22:00,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:00,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:00,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:00,994 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:00,995 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:01,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:01,009 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:01,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:01,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:01,010 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:01,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:01,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 05:22:01,043 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,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 05:22:01,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:01,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:01,043 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:01,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:01,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,068 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:01,068 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:22:01,069 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 05:22:01,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:01,209 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:01,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:22:01,209 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:01,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 05:22:01,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:01,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:01,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2022-12-06 05:22:01,210 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 05:22:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 870099446, now seen corresponding path program 1 times [2022-12-06 05:22:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281383296] [2022-12-06 05:22:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:01,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 05:22:01,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:01,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281383296] [2022-12-06 05:22:01,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281383296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:01,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:01,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:01,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434834746] [2022-12-06 05:22:01,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:01,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:01,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:01,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:01,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:01,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:01,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 05:22:01,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:01,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:01,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:01,534 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:01,535 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:01,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:01,548 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:01,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:01,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:01,549 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:01,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:01,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 05:22:01,583 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,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 05:22:01,583 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:01,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:01,583 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:01,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:01,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:01,607 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:22:01,608 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 05:22:01,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:01,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:01,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:01,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:22:01,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:01,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 05:22:01,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:01,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 05:22:01,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2022-12-06 05:22:01,755 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 05:22:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1682057515, now seen corresponding path program 1 times [2022-12-06 05:22:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:01,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588423110] [2022-12-06 05:22:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:01,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588423110] [2022-12-06 05:22:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588423110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239498839] [2022-12-06 05:22:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:01,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:01,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:01,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 05:22:01,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:01,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:01,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:02,106 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:02,106 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:22:02,113 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 05:22:02,120 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:02,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:02,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:02,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 05:22:02,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:02,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 05:22:02,153 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,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 05:22:02,153 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:02,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:02,153 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:02,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:02,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,178 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:02,178 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:22:02,179 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 05:22:02,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:02,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:02,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:22:02,333 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:02,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 05:22:02,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:02,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 05:22:02,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2022-12-06 05:22:02,334 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 05:22:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 60752820, now seen corresponding path program 1 times [2022-12-06 05:22:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:02,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856795636] [2022-12-06 05:22:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:02,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 05:22:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856795636] [2022-12-06 05:22:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856795636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:02,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:02,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742211131] [2022-12-06 05:22:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:02,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:02,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 05:22:02,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:02,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:02,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:02,677 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:02,677 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:02,684 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 05:22:02,691 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:02,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:02,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:02,692 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:02,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:02,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 05:22:02,726 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,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 05:22:02,726 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:02,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:02,726 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:02,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:02,727 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,751 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:02,751 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:22:02,752 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 05:22:02,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:02,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:02,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:02,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:22:02,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:02,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 05:22:02,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:02,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 05:22:02,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2022-12-06 05:22:02,913 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 05:22:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1803563155, now seen corresponding path program 1 times [2022-12-06 05:22:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:02,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514975444] [2022-12-06 05:22:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:02,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:02,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514975444] [2022-12-06 05:22:02,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514975444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:02,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:02,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077958689] [2022-12-06 05:22:02,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:02,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:02,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:02,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:02,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:02,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:02,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:03,255 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:03,255 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:03,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:03,267 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:03,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:03,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:03,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 05:22:03,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:03,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 05:22:03,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,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 05:22:03,299 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:03,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:03,299 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:03,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:03,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,323 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:03,323 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:22:03,324 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 05:22:03,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:03,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:03,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:22:03,472 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:03,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 05:22:03,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:03,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 05:22:03,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2022-12-06 05:22:03,472 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 05:22:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -748593806, now seen corresponding path program 1 times [2022-12-06 05:22:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:03,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535549268] [2022-12-06 05:22:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:03,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:03,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535549268] [2022-12-06 05:22:03,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535549268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:03,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:03,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620152210] [2022-12-06 05:22:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:03,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:03,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:03,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 05:22:03,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:03,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:03,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:03,823 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:03,823 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:03,829 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 05:22:03,836 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:03,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:03,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:03,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 05:22:03,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:03,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:03,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,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 05:22:03,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:03,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:03,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:03,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:03,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:03,893 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:03,894 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 05:22:03,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:03,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:04,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:04,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:22:04,059 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:04,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:04,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:04,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:04,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2022-12-06 05:22:04,059 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 05:22:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 994216529, now seen corresponding path program 1 times [2022-12-06 05:22:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:04,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986383561] [2022-12-06 05:22:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:04,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 05:22:04,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:04,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986383561] [2022-12-06 05:22:04,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986383561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:04,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:04,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085204001] [2022-12-06 05:22:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:04,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:04,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:04,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:04,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:04,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:04,412 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:04,413 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:04,418 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 05:22:04,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:04,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:04,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:04,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 05:22:04,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:04,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 05:22:04,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:04,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 05:22:04,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:04,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:04,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:04,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:04,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:04,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:04,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:04,479 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:04,479 INFO L131 PetriNetUnfolder]: For 3297/3507 co-relation queries the response was YES. [2022-12-06 05:22:04,480 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 05:22:04,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:04,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:04,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:04,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:04,630 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:04,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:04,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:04,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:04,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2022-12-06 05:22:04,630 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 05:22:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1557940432, now seen corresponding path program 1 times [2022-12-06 05:22:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:04,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19429478] [2022-12-06 05:22:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:04,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 05:22:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:04,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19429478] [2022-12-06 05:22:04,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19429478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:04,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:04,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271520285] [2022-12-06 05:22:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:04,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:04,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:04,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:04,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:04,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 05:22:04,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:04,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:04,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:04,978 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:04,978 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:04,985 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 05:22:04,992 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:04,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:04,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:04,993 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:04,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:05,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:05,028 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:05,029 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:05,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:05,029 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:05,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:05,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,053 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:05,053 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:22:05,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 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 05:22:05,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:05,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:05,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:22:05,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:05,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 05:22:05,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:05,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 05:22:05,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2022-12-06 05:22:05,204 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 05:22:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 184869903, now seen corresponding path program 1 times [2022-12-06 05:22:05,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:05,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363045459] [2022-12-06 05:22:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:05,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 05:22:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:05,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363045459] [2022-12-06 05:22:05,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363045459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:05,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:05,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731580533] [2022-12-06 05:22:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:05,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:05,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 05:22:05,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:05,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:05,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:05,549 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:05,549 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:05,556 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 05:22:05,563 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:05,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:05,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:05,564 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:05,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:05,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:05,596 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:05,596 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:05,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:05,596 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:05,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:05,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,628 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:05,628 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:05,629 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 05:22:05,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:05,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:05,787 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:05,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:22:05,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:05,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 05:22:05,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:05,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 05:22:05,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2022-12-06 05:22:05,788 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 05:22:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:05,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1927680238, now seen corresponding path program 1 times [2022-12-06 05:22:05,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:05,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687354675] [2022-12-06 05:22:05,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:05,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:05,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 05:22:05,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:05,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687354675] [2022-12-06 05:22:05,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687354675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:05,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:05,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663660479] [2022-12-06 05:22:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:05,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:05,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:05,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:05,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 05:22:05,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:05,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:05,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:06,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:06,128 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:06,138 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 05:22:06,146 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:06,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:06,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:06,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 05:22:06,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:06,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:06,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:06,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:06,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:06,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:06,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:06,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,206 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:06,206 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:06,207 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 05:22:06,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:06,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:06,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:06,358 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:06,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:06,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:06,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:06,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2022-12-06 05:22:06,359 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 05:22:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash -624476723, now seen corresponding path program 1 times [2022-12-06 05:22:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:06,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163153656] [2022-12-06 05:22:06,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:06,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:06,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 05:22:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163153656] [2022-12-06 05:22:06,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163153656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:06,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:06,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:06,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162958121] [2022-12-06 05:22:06,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:06,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:06,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:06,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:06,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:06,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 05:22:06,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:06,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:06,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:06,705 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:06,705 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:22:06,715 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 05:22:06,725 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:06,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:06,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:06,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 05:22:06,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:06,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:06,773 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:06,773 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:06,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:06,774 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:06,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:06,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,807 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:06,808 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:22:06,809 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 05:22:06,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:06,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:06,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:06,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 05:22:06,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:06,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 05:22:06,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:06,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 05:22:06,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2022-12-06 05:22:06,998 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 05:22:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1118333612, now seen corresponding path program 1 times [2022-12-06 05:22:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:06,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946638158] [2022-12-06 05:22:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:07,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 05:22:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:07,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946638158] [2022-12-06 05:22:07,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946638158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:07,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:07,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326821334] [2022-12-06 05:22:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:07,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:07,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:07,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:07,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 05:22:07,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:07,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:07,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:07,405 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:07,405 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:22:07,412 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 05:22:07,419 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:07,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:07,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:07,420 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:07,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:07,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 05:22:07,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:07,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 05:22:07,453 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:07,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:07,453 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:07,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:07,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:07,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:07,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:07,478 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:07,479 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:22:07,480 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 05:22:07,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:07,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:07,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:07,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:22:07,644 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:07,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 05:22:07,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:07,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 05:22:07,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2022-12-06 05:22:07,644 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 05:22:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1433823349, now seen corresponding path program 1 times [2022-12-06 05:22:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720577572] [2022-12-06 05:22:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:07,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 05:22:07,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:07,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720577572] [2022-12-06 05:22:07,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720577572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:07,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:07,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409914915] [2022-12-06 05:22:07,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:07,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:07,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:07,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:07,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 05:22:07,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:07,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:07,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:07,971 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:07,971 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:07,978 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 05:22:07,986 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:07,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:07,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:07,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:07,987 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:07,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:08,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 05:22:08,019 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:08,019 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:08,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:08,019 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,020 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:08,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:08,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,044 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:08,044 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:22:08,045 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 05:22:08,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:08,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:08,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:22:08,188 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:08,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:08,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:08,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2022-12-06 05:22:08,189 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 05:22:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 308986986, now seen corresponding path program 1 times [2022-12-06 05:22:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:08,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086444792] [2022-12-06 05:22:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:08,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086444792] [2022-12-06 05:22:08,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086444792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:08,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:08,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844295292] [2022-12-06 05:22:08,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:08,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:08,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:08,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:08,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:08,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:08,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:08,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:08,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:08,545 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:08,545 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:08,552 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 05:22:08,559 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:08,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:08,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:08,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 05:22:08,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:08,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:08,593 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:08,593 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:08,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:08,593 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:08,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:08,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,618 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:08,619 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:08,620 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 05:22:08,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:08,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:08,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:08,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:08,770 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:08,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:08,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:08,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:08,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2022-12-06 05:22:08,770 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 05:22:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2051797321, now seen corresponding path program 1 times [2022-12-06 05:22:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:08,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361336756] [2022-12-06 05:22:08,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:08,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 05:22:08,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361336756] [2022-12-06 05:22:08,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361336756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:08,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:08,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:08,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411783492] [2022-12-06 05:22:08,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:08,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:08,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:08,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:08,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:08,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:08,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 05:22:08,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:08,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:08,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:09,094 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:09,094 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:09,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:09,109 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:09,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:09,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:09,109 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:09,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:09,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 05:22:09,144 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,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 05:22:09,144 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:09,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:09,144 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:09,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:09,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,169 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:09,169 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:22:09,170 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 05:22:09,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:09,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:09,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:22:09,317 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:09,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 05:22:09,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:09,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 05:22:09,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2022-12-06 05:22:09,318 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 05:22:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash -500359640, now seen corresponding path program 1 times [2022-12-06 05:22:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:09,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549244375] [2022-12-06 05:22:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:09,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549244375] [2022-12-06 05:22:09,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549244375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:09,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:09,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:09,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279718913] [2022-12-06 05:22:09,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:09,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:09,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:09,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:09,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:09,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:09,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:09,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:09,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:09,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:09,672 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:09,672 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:09,678 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 05:22:09,685 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:09,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:09,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:09,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 05:22:09,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:09,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:09,715 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:09,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:09,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:09,715 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:09,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:09,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,740 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:09,741 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:22:09,742 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 05:22:09,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:09,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:09,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:09,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:22:09,908 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:09,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:09,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 05:22:09,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2022-12-06 05:22:09,909 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 05:22:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1242450695, now seen corresponding path program 1 times [2022-12-06 05:22:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968976453] [2022-12-06 05:22:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:09,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 05:22:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:09,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968976453] [2022-12-06 05:22:09,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968976453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:09,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:09,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436188892] [2022-12-06 05:22:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:09,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:09,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:09,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 05:22:09,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:09,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:09,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:10,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:10,261 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:10,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 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 05:22:10,279 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:10,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:10,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:10,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:10,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:10,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 05:22:10,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,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 05:22:10,314 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:10,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:10,314 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:10,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:10,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,341 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:10,341 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:10,342 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 05:22:10,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:10,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:10,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:10,489 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:10,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 05:22:10,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:10,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 05:22:10,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2022-12-06 05:22:10,489 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 05:22:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1309706266, now seen corresponding path program 1 times [2022-12-06 05:22:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:10,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232455670] [2022-12-06 05:22:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:10,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:10,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 05:22:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:10,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232455670] [2022-12-06 05:22:10,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232455670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:10,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:10,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054982134] [2022-12-06 05:22:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:10,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:10,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:10,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 05:22:10,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:10,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:10,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:10,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:10,874 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:10,880 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 05:22:10,886 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:10,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:10,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:10,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 05:22:10,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:10,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 05:22:10,917 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,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 05:22:10,917 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:10,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:10,917 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:10,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:10,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,944 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:10,944 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:10,945 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 05:22:10,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:10,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:11,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:11,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:22:11,096 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:11,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:11,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:11,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:11,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2022-12-06 05:22:11,097 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 05:22:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 433104069, now seen corresponding path program 1 times [2022-12-06 05:22:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:11,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22811596] [2022-12-06 05:22:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:11,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22811596] [2022-12-06 05:22:11,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22811596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:11,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:11,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171945543] [2022-12-06 05:22:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:11,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:11,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:11,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 05:22:11,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:11,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:11,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:11,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:11,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:11,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 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 05:22:11,440 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:11,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:11,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:11,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:11,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 05:22:11,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:11,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 05:22:11,472 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:11,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 05:22:11,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:11,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:11,473 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:11,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:11,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:11,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:11,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:11,498 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:11,498 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:11,499 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 05:22:11,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:11,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:11,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:11,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:22:11,646 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:11,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:11,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:11,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 05:22:11,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2022-12-06 05:22:11,646 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 05:22:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2119052892, now seen corresponding path program 1 times [2022-12-06 05:22:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:11,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321986768] [2022-12-06 05:22:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:11,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 05:22:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321986768] [2022-12-06 05:22:11,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321986768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:11,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:11,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24806194] [2022-12-06 05:22:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:11,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:11,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:11,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 05:22:11,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:11,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:11,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:11,976 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:11,976 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:11,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:11,991 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:11,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:11,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:11,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 05:22:11,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:12,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 05:22:12,024 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,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 05:22:12,024 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:12,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:12,024 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:12,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:12,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,061 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:12,061 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:22:12,062 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 05:22:12,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:12,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:12,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:22:12,218 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:12,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 05:22:12,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:12,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 05:22:12,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2022-12-06 05:22:12,219 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 05:22:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash -376242557, now seen corresponding path program 1 times [2022-12-06 05:22:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:12,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524916261] [2022-12-06 05:22:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:12,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 05:22:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:12,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524916261] [2022-12-06 05:22:12,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524916261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:12,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:12,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631650992] [2022-12-06 05:22:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:12,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:12,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:12,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:12,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 05:22:12,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:12,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:12,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:12,562 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:12,563 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:12,570 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 05:22:12,578 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:12,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:12,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:12,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 05:22:12,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:12,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 05:22:12,612 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,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 05:22:12,612 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:12,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:12,612 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:12,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:12,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,637 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:12,637 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:12,638 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 05:22:12,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:12,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:12,789 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:12,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:22:12,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:12,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 05:22:12,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:12,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 05:22:12,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2022-12-06 05:22:12,790 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 05:22:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:12,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1366567778, now seen corresponding path program 1 times [2022-12-06 05:22:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:12,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781705820] [2022-12-06 05:22:12,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:12,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781705820] [2022-12-06 05:22:12,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781705820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:12,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:12,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666475422] [2022-12-06 05:22:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:12,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:12,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:12,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:12,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:12,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:12,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:12,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:12,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:12,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:13,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:13,128 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:13,135 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 05:22:13,143 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:13,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:13,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:13,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:13,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:13,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 05:22:13,177 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:13,177 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:13,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:13,178 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:13,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:13,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,202 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:13,202 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:13,203 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 05:22:13,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:13,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:13,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:13,355 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:13,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 05:22:13,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:13,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 05:22:13,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2022-12-06 05:22:13,355 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 05:22:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:13,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1185589183, now seen corresponding path program 1 times [2022-12-06 05:22:13,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:13,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888199271] [2022-12-06 05:22:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:13,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888199271] [2022-12-06 05:22:13,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888199271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:13,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:13,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398533938] [2022-12-06 05:22:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:13,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:13,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 05:22:13,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:13,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:13,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:13,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:13,714 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:13,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 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 05:22:13,729 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:13,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:13,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:13,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 05:22:13,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:13,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 05:22:13,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,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 05:22:13,765 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:13,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:13,765 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:13,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:13,765 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,790 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:13,790 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:22:13,791 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 05:22:13,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:13,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:13,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:13,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:22:13,944 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:13,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 05:22:13,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:13,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 05:22:13,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2022-12-06 05:22:13,944 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 05:22:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 557221152, now seen corresponding path program 1 times [2022-12-06 05:22:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39738573] [2022-12-06 05:22:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:14,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39738573] [2022-12-06 05:22:14,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39738573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:14,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:14,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947356369] [2022-12-06 05:22:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:14,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:14,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:14,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 05:22:14,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:14,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:14,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:14,283 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:14,283 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:14,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 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 05:22:14,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:14,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:14,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:14,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 05:22:14,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:14,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 05:22:14,332 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:14,333 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:14,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:14,333 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:14,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:14,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,367 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:14,367 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:22:14,368 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 05:22:14,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:14,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:14,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:22:14,515 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:14,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:14,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:14,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:14,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2022-12-06 05:22:14,515 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 05:22:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1994935809, now seen corresponding path program 1 times [2022-12-06 05:22:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:14,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364894969] [2022-12-06 05:22:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:14,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 05:22:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:14,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364894969] [2022-12-06 05:22:14,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364894969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:14,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730667582] [2022-12-06 05:22:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:14,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:14,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:14,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 05:22:14,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:14,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:14,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:14,881 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:14,881 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:14,887 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 05:22:14,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:14,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:14,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:14,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 05:22:14,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:14,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 05:22:14,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,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 05:22:14,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:14,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:14,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:14,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:14,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,953 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:14,953 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:14,954 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 05:22:14,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:14,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:15,103 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:15,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:15,103 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:15,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 05:22:15,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:15,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 05:22:15,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2022-12-06 05:22:15,104 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 05:22:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash -252125474, now seen corresponding path program 1 times [2022-12-06 05:22:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66352635] [2022-12-06 05:22:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:15,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:15,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66352635] [2022-12-06 05:22:15,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66352635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:15,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:15,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889765382] [2022-12-06 05:22:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:15,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:15,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:15,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:15,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 05:22:15,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:15,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:15,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:15,433 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:15,434 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:15,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 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 05:22:15,448 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:15,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:15,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:15,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 05:22:15,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:15,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:15,481 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:15,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:15,482 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:15,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:15,482 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:15,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:15,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:15,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:15,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:15,506 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:15,506 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:15,507 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 05:22:15,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:15,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:15,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:15,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:22:15,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:15,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 05:22:15,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:15,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 05:22:15,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2022-12-06 05:22:15,664 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 05:22:15,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1490684861, now seen corresponding path program 1 times [2022-12-06 05:22:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:15,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955032135] [2022-12-06 05:22:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:15,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 05:22:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955032135] [2022-12-06 05:22:15,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955032135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:15,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:15,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911219905] [2022-12-06 05:22:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:15,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:15,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:15,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 05:22:15,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:15,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:15,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:16,026 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:16,026 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:22:16,032 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 05:22:16,038 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:16,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:16,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:16,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:16,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 05:22:16,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:16,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 05:22:16,066 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,067 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:16,067 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:16,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:16,067 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:16,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:16,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,091 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:16,092 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:22:16,093 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 05:22:16,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:16,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:16,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:22:16,251 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:16,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 05:22:16,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:16,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 05:22:16,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2022-12-06 05:22:16,251 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 05:22:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1061472100, now seen corresponding path program 1 times [2022-12-06 05:22:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814916050] [2022-12-06 05:22:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:16,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 05:22:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:16,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814916050] [2022-12-06 05:22:16,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814916050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:16,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:16,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293454339] [2022-12-06 05:22:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:16,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:16,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:16,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:16,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 05:22:16,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:16,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:16,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:16,581 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:16,581 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:16,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:16,595 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:16,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:16,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:16,596 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:16,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:16,631 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:16,631 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:16,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:16,631 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:16,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:16,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,667 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:16,667 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:22:16,669 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 05:22:16,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:16,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:16,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:16,879 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 05:22:16,879 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:16,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 05:22:16,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:16,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 05:22:16,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2022-12-06 05:22:16,879 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 05:22:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 681338235, now seen corresponding path program 1 times [2022-12-06 05:22:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:16,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897484941] [2022-12-06 05:22:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:16,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 05:22:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:16,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897484941] [2022-12-06 05:22:16,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897484941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:16,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000484987] [2022-12-06 05:22:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:16,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:16,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:16,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 05:22:16,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:16,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:16,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:17,207 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:17,207 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:17,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:17,221 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:17,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:17,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:17,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 05:22:17,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:17,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 05:22:17,282 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,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 05:22:17,282 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:17,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:17,282 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:17,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:17,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,318 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:17,319 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:22:17,320 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 05:22:17,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:17,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:17,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:22:17,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22: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 05:22:17,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22: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 05:22:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2022-12-06 05:22:17,467 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 05:22:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1870818726, now seen corresponding path program 1 times [2022-12-06 05:22:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296416203] [2022-12-06 05:22:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:17,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 05:22:17,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:17,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296416203] [2022-12-06 05:22:17,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296416203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:17,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:17,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103715182] [2022-12-06 05:22:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:17,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:17,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:17,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 05:22:17,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:17,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:17,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:17,806 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:17,806 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:22:17,813 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 05:22:17,820 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:17,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:17,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:17,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 05:22:17,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:17,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 05:22:17,854 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,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 05:22:17,854 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:17,854 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:17,854 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,855 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:17,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:17,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,879 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:17,879 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:17,880 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 05:22:17,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:17,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:18,021 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:18,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:22:18,022 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:18,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:18,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:18,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2022-12-06 05:22:18,022 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 05:22:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash -128008391, now seen corresponding path program 1 times [2022-12-06 05:22:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:18,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040695851] [2022-12-06 05:22:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:18,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:18,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040695851] [2022-12-06 05:22:18,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040695851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:18,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:18,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879163879] [2022-12-06 05:22:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:18,086 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:18,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 05:22:18,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:18,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:18,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:18,355 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:18,355 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:22:18,362 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 05:22:18,370 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:18,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:18,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:18,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:18,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:18,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:18,402 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:18,402 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:18,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:18,402 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:18,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:18,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,427 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:18,427 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:22:18,428 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 05:22:18,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,430 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:18,585 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:18,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:22:18,586 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:18,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:18,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:18,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:18,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2022-12-06 05:22:18,586 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 05:22:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1614801944, now seen corresponding path program 1 times [2022-12-06 05:22:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:18,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777303026] [2022-12-06 05:22:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:18,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 05:22:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:18,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777303026] [2022-12-06 05:22:18,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777303026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:18,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:18,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819909838] [2022-12-06 05:22:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:18,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:18,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:18,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 05:22:18,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:18,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:18,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:18,926 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:18,927 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:18,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:18,941 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:18,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:18,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:18,942 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:18,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:18,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:18,974 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:18,974 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:18,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:18,974 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:18,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:18,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:18,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,000 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:19,000 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:22:19,001 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 05:22:19,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:19,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:19,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:22:19,141 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:19,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 05:22:19,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:19,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 05:22:19,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2022-12-06 05:22:19,142 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 05:22:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash -937355017, now seen corresponding path program 1 times [2022-12-06 05:22:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:19,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347929705] [2022-12-06 05:22:19,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:19,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:19,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347929705] [2022-12-06 05:22:19,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347929705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:19,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:19,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856517832] [2022-12-06 05:22:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:19,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:19,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:19,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:19,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:19,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:19,466 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:19,466 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:19,473 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 05:22:19,480 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:19,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:19,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:19,481 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:19,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:19,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:19,514 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:19,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:19,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:19,515 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:19,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:19,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,541 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:19,541 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:22:19,542 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 05:22:19,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:19,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:19,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:19,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:22:19,705 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:19,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 05:22:19,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:19,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 05:22:19,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2022-12-06 05:22:19,706 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 05:22:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash 805455318, now seen corresponding path program 1 times [2022-12-06 05:22:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:19,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013138958] [2022-12-06 05:22:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013138958] [2022-12-06 05:22:19,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013138958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:19,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:19,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550951824] [2022-12-06 05:22:19,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:19,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:19,773 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:19,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:19,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:19,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:19,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:20,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:20,045 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:20,051 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 05:22:20,058 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:20,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:20,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:20,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 05:22:20,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:20,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 05:22:20,090 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:20,091 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:20,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:20,091 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:20,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:20,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,116 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:20,116 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:20,117 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 05:22:20,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:20,258 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:20,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:22:20,258 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:20,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 05:22:20,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:20,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 05:22:20,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2022-12-06 05:22:20,259 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 05:22:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1746701643, now seen corresponding path program 1 times [2022-12-06 05:22:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:20,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013642303] [2022-12-06 05:22:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:20,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:20,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013642303] [2022-12-06 05:22:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013642303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:20,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:20,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275801192] [2022-12-06 05:22:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:20,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:20,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:20,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:20,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:20,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:20,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:20,579 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:20,580 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:20,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:20,594 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:20,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:20,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:20,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:20,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 05:22:20,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:20,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:20,629 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:20,629 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:20,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:20,629 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,630 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:20,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:20,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,655 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:20,655 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:22:20,656 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 05:22:20,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:20,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:20,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:20,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:22:20,805 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:20,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 05:22:20,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:20,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 05:22:20,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2022-12-06 05:22:20,805 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 05:22:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:20,805 INFO L85 PathProgramCache]: Analyzing trace with hash -3891308, now seen corresponding path program 1 times [2022-12-06 05:22:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:20,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349905707] [2022-12-06 05:22:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:20,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 05:22:20,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:20,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349905707] [2022-12-06 05:22:20,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349905707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:20,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:20,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812206993] [2022-12-06 05:22:20,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:20,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:20,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:20,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 05:22:20,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:20,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:20,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:21,164 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:21,164 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:21,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 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 05:22:21,179 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:21,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:21,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:21,180 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:21,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 05:22:21,220 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,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 05:22:21,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:21,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:21,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:21,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:21,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,256 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:21,256 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:22:21,258 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 05:22:21,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:21,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:21,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 05:22:21,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:21,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 05:22:21,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:21,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 05:22:21,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2022-12-06 05:22:21,497 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 05:22:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1738919027, now seen corresponding path program 1 times [2022-12-06 05:22:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:21,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366429930] [2022-12-06 05:22:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:21,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 05:22:21,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366429930] [2022-12-06 05:22:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366429930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:21,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808010441] [2022-12-06 05:22:21,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:21,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:21,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:21,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 05:22:21,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:21,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:21,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:21,836 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:21,836 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:21,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 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 05:22:21,851 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:21,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:21,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:21,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 05:22:21,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:21,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 05:22:21,885 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,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 05:22:21,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:21,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:21,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:21,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:21,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,911 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:21,911 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:22:21,912 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 05:22:21,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:21,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:22,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:22,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:22:22,057 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:22,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 05:22:22,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:22,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 05:22:22,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2022-12-06 05:22:22,057 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 05:22:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -813237934, now seen corresponding path program 1 times [2022-12-06 05:22:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:22,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479394296] [2022-12-06 05:22:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:22,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 05:22:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:22,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479394296] [2022-12-06 05:22:22,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479394296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:22,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:22,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509818616] [2022-12-06 05:22:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:22,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:22,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:22,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 05:22:22,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:22,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:22,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:22,413 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:22,414 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:22,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 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 05:22:22,426 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:22,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:22,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:22,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 05:22:22,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:22,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:22,457 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:22,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 05:22:22,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:22,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:22,458 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:22,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:22,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:22,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:22,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:22,483 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:22,484 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:22,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 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 05:22:22,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:22,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:22,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:22,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:22:22,637 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:22,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 05:22:22,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:22,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 05:22:22,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2022-12-06 05:22:22,638 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 05:22:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 929572401, now seen corresponding path program 1 times [2022-12-06 05:22:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:22,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306689271] [2022-12-06 05:22:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:22,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 05:22:22,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:22,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306689271] [2022-12-06 05:22:22,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306689271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:22,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:22,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720643254] [2022-12-06 05:22:22,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:22,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:22,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:22,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 05:22:22,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:22,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:22,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:22,984 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:22,984 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:22,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 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 05:22:22,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:22,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:23,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:23,001 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:23,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:23,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:23,037 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,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 05:22:23,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:23,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:23,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:23,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:23,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,066 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:23,066 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:23,067 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 05:22:23,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:23,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:23,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:22:23,222 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:23,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:23,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:23,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2022-12-06 05:22:23,222 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 05:22:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1622584560, now seen corresponding path program 1 times [2022-12-06 05:22:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488204314] [2022-12-06 05:22:23,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:23,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:23,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 05:22:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:23,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488204314] [2022-12-06 05:22:23,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488204314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:23,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:23,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7162572] [2022-12-06 05:22:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:23,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:23,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:23,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:23,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 05:22:23,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:23,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:23,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:23,564 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:23,564 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:22:23,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 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 05:22:23,577 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:23,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:23,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:23,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:23,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 05:22:23,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:23,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:23,634 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,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 05:22:23,635 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:23,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:23,635 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:23,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:23,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,663 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:23,663 INFO L131 PetriNetUnfolder]: For 3164/3307 co-relation queries the response was YES. [2022-12-06 05:22:23,664 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 05:22:23,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:23,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:23,823 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:23,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:22:23,824 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:23,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 05:22:23,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:23,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 05:22:23,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2022-12-06 05:22:23,824 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 05:22:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash 120225775, now seen corresponding path program 1 times [2022-12-06 05:22:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103637245] [2022-12-06 05:22:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:23,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:23,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103637245] [2022-12-06 05:22:23,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103637245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:23,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:23,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204723568] [2022-12-06 05:22:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:23,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:23,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:23,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:23,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:23,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:23,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:24,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:24,196 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:24,206 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 05:22:24,215 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:24,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:24,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:24,216 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:24,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:24,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:24,249 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:24,250 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:24,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:24,250 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:24,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:24,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,275 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:24,275 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:22:24,276 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 05:22:24,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:24,429 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:24,429 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:22:24,429 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:24,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:24,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:24,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:24,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2022-12-06 05:22:24,429 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 05:22:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1863036110, now seen corresponding path program 1 times [2022-12-06 05:22:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:24,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452746524] [2022-12-06 05:22:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:24,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 05:22:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:24,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452746524] [2022-12-06 05:22:24,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452746524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:24,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:24,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763702259] [2022-12-06 05:22:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:24,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:24,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:24,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 05:22:24,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:24,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:24,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:24,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:24,753 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:24,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 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 05:22:24,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:24,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:24,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:24,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 05:22:24,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:24,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 05:22:24,798 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,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 05:22:24,798 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:24,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:24,798 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:24,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:24,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,823 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:24,823 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:22:24,824 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 05:22:24,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:24,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:24,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:24,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:22:24,992 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:24,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 05:22:24,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:24,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 05:22:24,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2022-12-06 05:22:24,992 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 05:22:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -689120851, now seen corresponding path program 1 times [2022-12-06 05:22:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:24,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712191488] [2022-12-06 05:22:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:25,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 05:22:25,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:25,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712191488] [2022-12-06 05:22:25,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712191488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:25,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:25,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323935893] [2022-12-06 05:22:25,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:25,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:25,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:25,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 05:22:25,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:25,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:25,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:25,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:25,417 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:22:25,424 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 05:22:25,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:25,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:25,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:25,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 05:22:25,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:25,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 05:22:25,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:25,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 05:22:25,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:25,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:25,464 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:25,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:25,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:25,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:25,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:25,489 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:25,489 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:22:25,490 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 05:22:25,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:25,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:25,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:25,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:22:25,662 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:25,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 05:22:25,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:25,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 05:22:25,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2022-12-06 05:22:25,662 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 05:22:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1053689484, now seen corresponding path program 1 times [2022-12-06 05:22:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:25,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651693795] [2022-12-06 05:22:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:25,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 05:22:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:25,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651693795] [2022-12-06 05:22:25,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651693795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:25,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:25,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361847449] [2022-12-06 05:22:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:25,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:25,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:25,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:25,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 05:22:25,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:25,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:25,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:25,999 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:25,999 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:26,005 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 05:22:26,012 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:26,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:26,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:26,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 05:22:26,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:26,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 05:22:26,046 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,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 05:22:26,046 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:26,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:26,046 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:26,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:26,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,071 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:26,071 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:22:26,072 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 05:22:26,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:26,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:26,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:22:26,230 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:26,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 05:22:26,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:26,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 05:22:26,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2022-12-06 05:22:26,230 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 05:22:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1498467477, now seen corresponding path program 1 times [2022-12-06 05:22:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:26,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633179924] [2022-12-06 05:22:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:26,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 05:22:26,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:26,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633179924] [2022-12-06 05:22:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633179924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:26,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577507288] [2022-12-06 05:22:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:26,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:26,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:26,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 05:22:26,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:26,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:26,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:26,590 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:26,590 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22: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 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 05:22:26,602 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:26,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:26,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:26,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 05:22:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:26,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:26,630 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:26,630 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:26,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:26,631 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:26,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:26,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,655 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:26,655 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:26,656 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 05:22:26,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:26,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:26,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:26,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:22:26,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22: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 05:22:26,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22: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 05:22:26,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2022-12-06 05:22:26,809 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 05:22:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash 244342858, now seen corresponding path program 1 times [2022-12-06 05:22:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:26,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703950622] [2022-12-06 05:22:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:26,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 05:22:26,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:26,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703950622] [2022-12-06 05:22:26,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703950622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:26,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:26,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:26,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766692037] [2022-12-06 05:22:26,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:26,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:26,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:26,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 05:22:26,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:26,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:26,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:27,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:27,134 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:27,141 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 05:22:27,148 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:27,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:27,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:27,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 05:22:27,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:27,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 05:22:27,180 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:27,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:27,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:27,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:27,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:27,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,205 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:27,206 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:27,206 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 05:22:27,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:27,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:27,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:22:27,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:27,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 05:22:27,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:27,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 05:22:27,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2022-12-06 05:22:27,354 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 05:22:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1987153193, now seen corresponding path program 1 times [2022-12-06 05:22:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515573280] [2022-12-06 05:22:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:27,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515573280] [2022-12-06 05:22:27,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515573280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:27,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:27,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084937806] [2022-12-06 05:22:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:27,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:27,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:27,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:27,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:27,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:27,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:27,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:27,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:27,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:27,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:27,713 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:27,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 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 05:22:27,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:27,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:27,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:27,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 05:22:27,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:27,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 05:22:27,760 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,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 05:22:27,761 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:27,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:27,761 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:27,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:27,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,785 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:27,785 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:27,786 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 05:22:27,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:27,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:27,933 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:27,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:22:27,933 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:27,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 05:22:27,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:27,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 05:22:27,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2022-12-06 05:22:27,933 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 05:22:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash -565003768, now seen corresponding path program 1 times [2022-12-06 05:22:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:27,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349708921] [2022-12-06 05:22:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22: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 05:22:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:27,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349708921] [2022-12-06 05:22:27,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349708921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:27,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:27,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443280974] [2022-12-06 05:22:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:27,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:27,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:27,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:27,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:27,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:27,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:28,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:28,275 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:28,281 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 05:22:28,288 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:28,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:28,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:28,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 05:22:28,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:28,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:28,321 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:28,321 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:28,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:28,322 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:28,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:28,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,346 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:28,346 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:22:28,347 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 05:22:28,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:28,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:28,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:22:28,498 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:28,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 05:22:28,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:28,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 05:22:28,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2022-12-06 05:22:28,498 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 05:22:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1177806567, now seen corresponding path program 1 times [2022-12-06 05:22:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:28,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39527957] [2022-12-06 05:22:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:28,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39527957] [2022-12-06 05:22:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39527957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992235187] [2022-12-06 05:22:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:28,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:28,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 05:22:28,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:28,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:28,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:28,834 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:28,834 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:28,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 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 05:22:28,848 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:28,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:28,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:28,849 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:28,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:28,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 05:22:28,880 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,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 05:22:28,880 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:28,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:28,880 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:28,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:28,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,905 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:28,905 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:22:28,906 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 05:22:28,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:28,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:29,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:29,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:29,051 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:29,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 05:22:29,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:29,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 05:22:29,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2022-12-06 05:22:29,051 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 05:22:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1374350394, now seen corresponding path program 1 times [2022-12-06 05:22:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:29,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163582354] [2022-12-06 05:22:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:29,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 05:22:29,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:29,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163582354] [2022-12-06 05:22:29,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163582354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:29,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:29,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669239092] [2022-12-06 05:22:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:29,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:29,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:29,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:29,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 05:22:29,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:29,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:29,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:29,389 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:29,389 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:29,396 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 05:22:29,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:29,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:29,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:29,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 05:22:29,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:29,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 05:22:29,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,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 05:22:29,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:29,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:29,438 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:29,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:29,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,473 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:29,473 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:29,474 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 05:22:29,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:29,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:29,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:22:29,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:29,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 05:22:29,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:29,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 05:22:29,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2022-12-06 05:22:29,627 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 05:22:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash 368459941, now seen corresponding path program 1 times [2022-12-06 05:22:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:29,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545305833] [2022-12-06 05:22:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:29,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:29,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545305833] [2022-12-06 05:22:29,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545305833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:29,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:29,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305925] [2022-12-06 05:22:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:29,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:29,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:29,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 05:22:29,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:29,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:29,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:29,949 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:29,950 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:29,956 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 05:22:29,963 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:29,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:29,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:29,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 05:22:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:29,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 05:22:29,997 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,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 05:22:29,997 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:29,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:29,997 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:29,998 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:29,998 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:29,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,022 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:30,023 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:30,024 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 05:22:30,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:30,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:30,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:22:30,180 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:30,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 05:22:30,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:30,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:30,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2022-12-06 05:22:30,181 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 05:22:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2111270276, now seen corresponding path program 1 times [2022-12-06 05:22:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:30,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040727797] [2022-12-06 05:22:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:30,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040727797] [2022-12-06 05:22:30,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040727797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:30,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:30,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696794426] [2022-12-06 05:22:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:30,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:30,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:30,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:30,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:30,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:30,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 05:22:30,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:30,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:30,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:30,518 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:30,518 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:30,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:30,532 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:30,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:30,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:30,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 05:22:30,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:30,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 05:22:30,563 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:30,564 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:30,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:30,564 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:30,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:30,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,588 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:30,588 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:22:30,589 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 05:22:30,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:30,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:30,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:30,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:30,735 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:30,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 05:22:30,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:30,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 05:22:30,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2022-12-06 05:22:30,735 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 05:22:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -440886685, now seen corresponding path program 1 times [2022-12-06 05:22:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:30,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130694199] [2022-12-06 05:22:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:30,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 05:22:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130694199] [2022-12-06 05:22:30,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130694199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:30,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:30,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813772626] [2022-12-06 05:22:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:30,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:30,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:30,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:30,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:30,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 05:22:30,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:30,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:30,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:31,082 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:31,082 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:31,088 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 05:22:31,094 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:31,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:31,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:31,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 05:22:31,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:31,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:31,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,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 05:22:31,123 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:31,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:31,123 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:31,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:31,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,147 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:31,148 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:31,149 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 05:22:31,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:31,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:31,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:22:31,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:31,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 05:22:31,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:31,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 05:22:31,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2022-12-06 05:22:31,296 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 05:22:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1301923650, now seen corresponding path program 1 times [2022-12-06 05:22:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:31,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522835796] [2022-12-06 05:22:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:31,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 05:22:31,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:31,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522835796] [2022-12-06 05:22:31,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522835796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:31,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:31,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662297198] [2022-12-06 05:22:31,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:31,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:31,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:31,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:31,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:31,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:31,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 05:22:31,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:31,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:31,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:31,658 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:31,659 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:31,665 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 05:22:31,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:31,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:31,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:31,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 05:22:31,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:31,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 05:22:31,705 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:31,705 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:31,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:31,705 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:31,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:31,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,730 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:31,731 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:31,731 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 05:22:31,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:31,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:31,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:31,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:31,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:31,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 05:22:31,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:31,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 05:22:31,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2022-12-06 05:22:31,882 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 05:22:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1250233311, now seen corresponding path program 1 times [2022-12-06 05:22:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:31,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929516861] [2022-12-06 05:22:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:31,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 05:22:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:31,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929516861] [2022-12-06 05:22:31,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929516861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:31,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:31,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:31,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631277468] [2022-12-06 05:22:31,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:31,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:31,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:31,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:31,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 05:22:31,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:31,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:31,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:32,206 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:32,207 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:32,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 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 05:22:32,221 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:32,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:32,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:32,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 05:22:32,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:32,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 05:22:32,254 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,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 05:22:32,254 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:32,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:32,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:32,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:32,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,279 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:32,279 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:22:32,280 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 05:22:32,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:32,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:32,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:22:32,433 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:32,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:32,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:32,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 05:22:32,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2022-12-06 05:22:32,433 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 05:22:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 492577024, now seen corresponding path program 1 times [2022-12-06 05:22:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:32,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217050229] [2022-12-06 05:22:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:32,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217050229] [2022-12-06 05:22:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217050229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:32,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:32,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868657279] [2022-12-06 05:22:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:32,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:32,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:32,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:32,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:32,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:32,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:32,779 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:32,779 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:22:32,787 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 05:22:32,794 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:32,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:32,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:32,795 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:32,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:32,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:32,827 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,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 05:22:32,827 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:32,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:32,827 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:32,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:32,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,852 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:32,853 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:22:32,854 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 05:22:32,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:32,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:32,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:32,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:32,998 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:32,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 05:22:32,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:32,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 05:22:32,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2022-12-06 05:22:32,998 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 05:22:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2059579937, now seen corresponding path program 1 times [2022-12-06 05:22:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:32,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232672507] [2022-12-06 05:22:32,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:33,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:33,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232672507] [2022-12-06 05:22:33,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232672507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:33,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:33,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:33,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875105066] [2022-12-06 05:22:33,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:33,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:33,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:33,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:33,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:33,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:33,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:33,338 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:33,338 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:33,345 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 05:22:33,352 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:33,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:33,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:33,353 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:33,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:33,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 05:22:33,384 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,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 05:22:33,384 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:33,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:33,384 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:33,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:33,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,409 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:33,409 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:33,410 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 05:22:33,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:33,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:33,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:33,559 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:33,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 05:22:33,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:33,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 05:22:33,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2022-12-06 05:22:33,560 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 05:22:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -316769602, now seen corresponding path program 1 times [2022-12-06 05:22:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:33,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558412645] [2022-12-06 05:22:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:33,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 05:22:33,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:33,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558412645] [2022-12-06 05:22:33,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558412645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:33,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:33,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210535133] [2022-12-06 05:22:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:33,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:33,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:33,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 05:22:33,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:33,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:33,900 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:33,901 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:22:33,907 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 05:22:33,914 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:33,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:33,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:33,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 05:22:33,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:33,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 05:22:33,945 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,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 05:22:33,945 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:33,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:33,945 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:33,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:33,946 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,979 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:33,979 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:22:33,980 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 05:22:33,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:33,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:34,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:34,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:34,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:34,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 05:22:34,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:34,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 05:22:34,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2022-12-06 05:22:34,122 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 05:22:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1426040733, now seen corresponding path program 1 times [2022-12-06 05:22:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:34,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593433415] [2022-12-06 05:22:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:34,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:34,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 05:22:34,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:34,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593433415] [2022-12-06 05:22:34,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593433415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:34,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:34,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757012737] [2022-12-06 05:22:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:34,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:34,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:34,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 05:22:34,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:34,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:34,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:34,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:34,446 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:34,453 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 05:22:34,460 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:34,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:34,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:34,461 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:34,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:34,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 05:22:34,507 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:34,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 05:22:34,508 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:34,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:34,508 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:34,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:34,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:34,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:34,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:34,538 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:34,538 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:34,539 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 05:22:34,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:34,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:34,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:34,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:22:34,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:34,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 05:22:34,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:34,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 05:22:34,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2022-12-06 05:22:34,701 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 05:22:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1126116228, now seen corresponding path program 1 times [2022-12-06 05:22:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:34,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007637049] [2022-12-06 05:22:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:34,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 05:22:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:34,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007637049] [2022-12-06 05:22:34,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007637049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:34,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:34,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983116224] [2022-12-06 05:22:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:34,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:34,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:34,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 05:22:34,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:34,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:34,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:35,021 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:35,021 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:35,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:35,034 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:35,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:35,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:35,035 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:35,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:35,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:35,068 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:35,068 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:35,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:35,069 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:35,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:35,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,093 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:35,093 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:22:35,094 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 05:22:35,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:35,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:35,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:22:35,239 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:35,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 05:22:35,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:35,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 05:22:35,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2022-12-06 05:22:35,239 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 05:22:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash 616694107, now seen corresponding path program 1 times [2022-12-06 05:22:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:35,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4781596] [2022-12-06 05:22:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:35,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 05:22:35,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:35,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4781596] [2022-12-06 05:22:35,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4781596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:35,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:35,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451578920] [2022-12-06 05:22:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:35,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:35,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:35,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 05:22:35,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:35,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:35,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:35,584 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:35,584 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:35,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:35,596 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:35,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:35,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:35,597 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:35,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:35,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:35,627 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,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 05:22:35,627 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:35,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:35,627 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:35,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:35,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,651 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:35,651 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:22:35,652 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 05:22:35,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:35,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:35,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:35,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:22:35,800 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:35,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:35,800 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:35,800 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:35,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2022-12-06 05:22:35,801 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 05:22:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1935462854, now seen corresponding path program 1 times [2022-12-06 05:22:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:35,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712553775] [2022-12-06 05:22:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:35,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712553775] [2022-12-06 05:22:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712553775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:35,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071316085] [2022-12-06 05:22:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:35,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:35,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:35,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:35,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:35,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:35,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:36,131 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:36,131 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:36,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 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 05:22:36,145 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:36,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:36,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:36,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 05:22:36,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:36,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 05:22:36,177 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:36,177 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:36,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:36,177 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:36,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:36,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,202 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:36,202 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:22:36,203 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 05:22:36,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:36,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:36,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:22:36,370 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:36,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 05:22:36,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:36,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 05:22:36,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2022-12-06 05:22:36,370 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 05:22:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash -192652519, now seen corresponding path program 1 times [2022-12-06 05:22:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:36,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147871618] [2022-12-06 05:22:36,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:36,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147871618] [2022-12-06 05:22:36,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147871618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:36,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:36,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754677345] [2022-12-06 05:22:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:36,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:36,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:36,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 05:22:36,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:36,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:36,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:36,690 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:36,690 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:36,696 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 05:22:36,703 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:36,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:36,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:36,704 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:36,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:36,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 05:22:36,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,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 05:22:36,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:36,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:36,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:36,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:36,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,761 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:36,761 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:36,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 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 05:22:36,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:36,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:36,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:36,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:22:36,906 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:36,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 05:22:36,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:36,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 05:22:36,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2022-12-06 05:22:36,906 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 05:22:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1550157816, now seen corresponding path program 1 times [2022-12-06 05:22:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273736241] [2022-12-06 05:22:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:36,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273736241] [2022-12-06 05:22:36,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273736241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:36,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:36,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857086939] [2022-12-06 05:22:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:36,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:36,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:36,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:36,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:36,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:37,282 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:37,282 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:22:37,288 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 05:22:37,296 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:37,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:37,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:37,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 05:22:37,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:37,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 05:22:37,327 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,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 05:22:37,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:37,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:37,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:37,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:37,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,352 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:37,352 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:22:37,353 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 05:22:37,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:37,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:37,514 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:22:37,514 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:37,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 05:22:37,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:37,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 05:22:37,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2022-12-06 05:22:37,514 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 05:22:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1001999145, now seen corresponding path program 1 times [2022-12-06 05:22:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:37,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924958290] [2022-12-06 05:22:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:37,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:37,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 05:22:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:37,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924958290] [2022-12-06 05:22:37,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924958290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:37,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:37,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:37,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261311578] [2022-12-06 05:22:37,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:37,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:37,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:37,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 05:22:37,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:37,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:37,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:37,836 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:37,836 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22: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 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 05:22:37,850 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:37,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:37,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:37,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 05:22:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:37,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 05:22:37,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,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 05:22:37,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:37,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:37,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:37,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:37,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,909 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:37,909 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:37,910 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 05:22:37,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:37,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:38,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:38,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:22:38,067 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:38,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 05:22:38,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:38,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 05:22:38,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2022-12-06 05:22:38,067 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 05:22:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash 740811190, now seen corresponding path program 1 times [2022-12-06 05:22:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:38,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964511269] [2022-12-06 05:22:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964511269] [2022-12-06 05:22:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964511269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:38,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:38,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624344026] [2022-12-06 05:22:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:38,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:38,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:38,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:38,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:38,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:38,396 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:38,396 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:38,406 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 05:22:38,414 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:38,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:38,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:38,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 05:22:38,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:38,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:38,450 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:38,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:38,450 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:38,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:38,450 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:38,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:38,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:38,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:38,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:38,475 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:38,475 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:38,476 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 05:22:38,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:38,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:38,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:38,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:38,621 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:38,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 05:22:38,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:38,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 05:22:38,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2022-12-06 05:22:38,621 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 05:22:38,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1811345771, now seen corresponding path program 1 times [2022-12-06 05:22:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:38,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154594736] [2022-12-06 05:22:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:38,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22: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 05:22:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:38,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154594736] [2022-12-06 05:22:38,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154594736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:38,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:38,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:38,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306310688] [2022-12-06 05:22:38,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:38,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:38,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:38,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:38,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22: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 05:22:38,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:38,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:38,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:38,954 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:38,954 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:38,961 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 05:22:38,969 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:38,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:38,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:38,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 05:22:38,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:39,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 05:22:39,005 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,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 05:22:39,005 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:39,005 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:39,006 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:39,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:39,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,030 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:39,030 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:39,031 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 05:22:39,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:39,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:39,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:22:39,181 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:39,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:39,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:39,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:39,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2022-12-06 05:22:39,181 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 05:22:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash -68535436, now seen corresponding path program 1 times [2022-12-06 05:22:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:39,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324327999] [2022-12-06 05:22:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:39,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 05:22:39,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324327999] [2022-12-06 05:22:39,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324327999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:39,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:39,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:39,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244619492] [2022-12-06 05:22:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:39,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:39,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:39,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:39,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:39,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:39,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 05:22:39,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:39,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:39,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:39,512 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:39,512 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:39,519 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 05:22:39,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:39,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:39,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:39,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 05:22:39,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:39,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 05:22:39,557 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,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 05:22:39,558 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:39,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:39,558 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:39,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:39,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,582 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:39,582 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:22:39,583 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 05:22:39,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:39,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:39,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:39,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:22:39,731 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:39,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:39,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:39,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:39,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2022-12-06 05:22:39,732 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 05:22:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1674274899, now seen corresponding path program 1 times [2022-12-06 05:22:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:39,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669110592] [2022-12-06 05:22:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:39,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 05:22:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669110592] [2022-12-06 05:22:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669110592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:39,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654542246] [2022-12-06 05:22:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:39,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:39,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:39,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 05:22:39,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:39,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:39,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:40,089 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:40,090 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:40,096 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 05:22:40,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:40,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:40,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:40,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 05:22:40,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:40,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:40,130 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:40,131 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:40,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:40,131 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:40,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:40,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,155 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:40,155 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:22:40,156 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 05:22:40,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:40,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:40,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:22:40,309 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:40,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 05:22:40,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:40,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 05:22:40,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2022-12-06 05:22:40,309 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 05:22:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash -877882062, now seen corresponding path program 1 times [2022-12-06 05:22:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:40,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600689869] [2022-12-06 05:22:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:40,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600689869] [2022-12-06 05:22:40,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600689869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:40,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:40,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:40,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681925287] [2022-12-06 05:22:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:40,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:40,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:40,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:40,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:40,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:40,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:40,628 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:40,628 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:22:40,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 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 05:22:40,642 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:40,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:40,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:40,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 05:22:40,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:40,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:40,674 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,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 05:22:40,675 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:40,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:40,675 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:40,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:40,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,699 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:40,700 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:22:40,700 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 05:22:40,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:40,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:40,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:40,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:22:40,853 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:40,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:40,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:40,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:40,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2022-12-06 05:22:40,853 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 05:22:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 864928273, now seen corresponding path program 1 times [2022-12-06 05:22:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57370122] [2022-12-06 05:22:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:40,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 05:22:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:40,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57370122] [2022-12-06 05:22:40,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57370122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:40,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:40,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823984856] [2022-12-06 05:22:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:40,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:40,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:40,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 05:22:40,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:40,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:41,204 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:41,204 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:41,211 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 05:22:41,218 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:41,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:41,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:41,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 05:22:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:41,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 05:22:41,251 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,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 05:22:41,252 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:41,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:41,252 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:41,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:41,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,277 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:41,277 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:22:41,278 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 05:22:41,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:41,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:41,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:41,423 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:41,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 05:22:41,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:41,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 05:22:41,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2022-12-06 05:22:41,424 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 05:22:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1687228688, now seen corresponding path program 1 times [2022-12-06 05:22:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:41,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321144814] [2022-12-06 05:22:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:41,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 05:22:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:41,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321144814] [2022-12-06 05:22:41,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321144814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:41,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:41,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098031452] [2022-12-06 05:22:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:41,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:41,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:41,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 05:22:41,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:41,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:41,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:41,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:41,756 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:41,762 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 05:22:41,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:41,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:41,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22: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 05:22:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:41,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 05:22:41,800 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,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 05:22:41,800 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:41,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:41,801 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:41,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:41,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,825 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:41,825 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:22:41,826 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 05:22:41,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:41,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:41,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:41,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:41,975 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:41,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 05:22:41,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:41,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 05:22:41,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2022-12-06 05:22:41,975 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 05:22:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash 55581647, now seen corresponding path program 1 times [2022-12-06 05:22:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863254661] [2022-12-06 05:22:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:42,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 05:22:42,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:42,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863254661] [2022-12-06 05:22:42,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863254661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:42,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:42,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963462520] [2022-12-06 05:22:42,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:42,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:42,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:42,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 05:22:42,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:42,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:42,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:42,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:42,303 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:42,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 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 05:22:42,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:42,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:42,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:42,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 05:22:42,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:42,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:42,348 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:42,348 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:42,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:42,348 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:42,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:42,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,372 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:42,372 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:42,373 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 05:22:42,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:42,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:42,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:22:42,518 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:42,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:42,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:42,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:42,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2022-12-06 05:22:42,518 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 05:22:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1798391982, now seen corresponding path program 1 times [2022-12-06 05:22:42,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:42,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308027917] [2022-12-06 05:22:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308027917] [2022-12-06 05:22:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308027917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:42,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:42,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102167837] [2022-12-06 05:22:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:42,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:42,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:42,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:42,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 05:22:42,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:42,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:42,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:42,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:42,840 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:42,847 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 05:22:42,854 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:42,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:42,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:42,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 05:22:42,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:42,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 05:22:42,887 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,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 05:22:42,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:42,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:42,887 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:42,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:42,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,912 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:42,912 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:42,913 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 05:22:42,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:42,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:43,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:43,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:22:43,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:43,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 05:22:43,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:43,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:43,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2022-12-06 05:22:43,070 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 05:22:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -753764979, now seen corresponding path program 1 times [2022-12-06 05:22:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:43,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926299023] [2022-12-06 05:22:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22: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 05:22:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:43,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926299023] [2022-12-06 05:22:43,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926299023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:43,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:43,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105878641] [2022-12-06 05:22:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:43,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22: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 05:22:43,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:43,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:43,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:43,434 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:43,434 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:43,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:43,449 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:43,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:43,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:43,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 05:22:43,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:43,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:43,482 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:43,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:43,482 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:43,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:43,482 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:43,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:43,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:43,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:43,507 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:43,507 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:22:43,508 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 05:22:43,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:43,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:43,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:43,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:43,659 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:43,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 05:22:43,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:43,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 05:22:43,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2022-12-06 05:22:43,659 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 05:22:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 989045356, now seen corresponding path program 1 times [2022-12-06 05:22:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:43,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830607162] [2022-12-06 05:22:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:43,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 05:22:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:43,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830607162] [2022-12-06 05:22:43,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830607162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:43,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:43,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:43,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113392803] [2022-12-06 05:22:43,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:43,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:43,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:43,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:43,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:43,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 05:22:43,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:43,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:43,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:43,985 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:43,985 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:44,001 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:44,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:44,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:44,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 05:22:44,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:44,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 05:22:44,033 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,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 05:22:44,033 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:44,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:44,033 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:44,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:44,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,058 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:44,058 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:22:44,059 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 05:22:44,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:44,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:44,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:22:44,221 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:44,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 05:22:44,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:44,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 05:22:44,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2022-12-06 05:22:44,221 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 05:22:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1563111605, now seen corresponding path program 1 times [2022-12-06 05:22:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:44,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239507114] [2022-12-06 05:22:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:44,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 05:22:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239507114] [2022-12-06 05:22:44,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239507114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:44,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:44,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123728596] [2022-12-06 05:22:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:44,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:44,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:44,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 05:22:44,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:44,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:44,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:44,594 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:44,594 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:44,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:44,606 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:44,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:44,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:44,607 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:44,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:44,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 05:22:44,635 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,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 05:22:44,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:44,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:44,636 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:44,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:44,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,661 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:44,661 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:44,662 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 05:22:44,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:44,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:44,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:44,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:22:44,806 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:44,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 05:22:44,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:44,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 05:22:44,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2022-12-06 05:22:44,806 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 05:22:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash 179698730, now seen corresponding path program 1 times [2022-12-06 05:22:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:44,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131648804] [2022-12-06 05:22:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131648804] [2022-12-06 05:22:44,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131648804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:44,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:44,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600154977] [2022-12-06 05:22:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:44,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:44,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:44,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:44,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:44,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:44,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:45,129 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:45,129 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:45,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:45,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:45,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:45,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:45,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:45,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 05:22:45,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:45,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 05:22:45,174 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,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 05:22:45,174 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:45,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:45,174 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:45,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:45,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,199 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:45,199 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:45,200 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 05:22:45,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:45,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:45,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:22:45,338 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:45,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 05:22:45,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:45,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 05:22:45,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2022-12-06 05:22:45,339 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 05:22:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1922509065, now seen corresponding path program 1 times [2022-12-06 05:22:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:45,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287042940] [2022-12-06 05:22:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:45,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:45,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287042940] [2022-12-06 05:22:45,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287042940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:45,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:45,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216909515] [2022-12-06 05:22:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:45,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:45,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:45,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:45,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:45,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:45,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:45,662 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:45,662 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:22:45,669 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 05:22:45,676 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:45,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:45,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:45,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 05:22:45,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:45,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:45,709 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,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 05:22:45,710 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:45,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:45,710 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:45,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:45,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,734 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:45,734 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:45,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 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 05:22:45,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:45,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:45,893 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:45,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:22:45,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:45,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 05:22:45,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:45,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 05:22:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2022-12-06 05:22:45,894 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 05:22:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash -629647896, now seen corresponding path program 1 times [2022-12-06 05:22:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:45,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034326173] [2022-12-06 05:22:45,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:45,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 05:22:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:45,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034326173] [2022-12-06 05:22:45,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034326173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:45,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:45,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198706746] [2022-12-06 05:22:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:45,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:45,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 05:22:45,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:45,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:45,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:46,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:46,242 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:22:46,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 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 05:22:46,255 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:46,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:46,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:46,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 05:22:46,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:46,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 05:22:46,286 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,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 05:22:46,286 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:46,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:46,286 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:46,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:46,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,311 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:46,311 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:22:46,312 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 05:22:46,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:46,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:46,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:22:46,458 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:46,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 05:22:46,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:46,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 05:22:46,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2022-12-06 05:22:46,458 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 05:22:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1113162439, now seen corresponding path program 1 times [2022-12-06 05:22:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:46,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704105356] [2022-12-06 05:22:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:46,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 05:22:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:46,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704105356] [2022-12-06 05:22:46,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704105356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:46,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:46,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118974031] [2022-12-06 05:22:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:46,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:46,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:46,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 05:22:46,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:46,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:46,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:46,803 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:46,803 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:46,809 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 05:22:46,816 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:46,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:46,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:46,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 05:22:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:46,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 05:22:46,850 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,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 05:22:46,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:46,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:46,851 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:46,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:46,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,875 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:46,875 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:22:46,876 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 05:22:46,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:46,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:47,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:47,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:22:47,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:47,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 05:22:47,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:47,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 05:22:47,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2022-12-06 05:22:47,029 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 05:22:47,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1438994522, now seen corresponding path program 1 times [2022-12-06 05:22:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:47,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315563049] [2022-12-06 05:22:47,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:47,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315563049] [2022-12-06 05:22:47,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315563049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:47,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:47,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521828194] [2022-12-06 05:22:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:47,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:47,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:47,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:47,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:47,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:47,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:47,355 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:47,356 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:22:47,363 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 05:22:47,370 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:47,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:47,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:47,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:47,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:47,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:47,403 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:47,403 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:47,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:47,404 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:47,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:47,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,428 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:47,428 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:22:47,429 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 05:22:47,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:47,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:47,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:22:47,584 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:47,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 05:22:47,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:47,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 05:22:47,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2022-12-06 05:22:47,585 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 05:22:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 303815813, now seen corresponding path program 1 times [2022-12-06 05:22:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:47,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936851534] [2022-12-06 05:22:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:47,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936851534] [2022-12-06 05:22:47,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936851534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:47,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:47,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509150537] [2022-12-06 05:22:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:47,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:47,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:47,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 05:22:47,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:47,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:47,933 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:47,934 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:47,940 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 05:22:47,947 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:47,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:47,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:47,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 05:22:47,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:47,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 05:22:47,981 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,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 05:22:47,981 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:47,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:47,981 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:47,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:47,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:47,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,006 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:48,006 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:48,007 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 05:22:48,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:48,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:48,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:22:48,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:48,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 05:22:48,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:48,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 05:22:48,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2022-12-06 05:22:48,163 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 05:22:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2046626148, now seen corresponding path program 1 times [2022-12-06 05:22:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:48,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103452836] [2022-12-06 05:22:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:48,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 05:22:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:48,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103452836] [2022-12-06 05:22:48,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103452836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:48,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:48,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756112378] [2022-12-06 05:22:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:48,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:48,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:48,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:48,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:48,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 05:22:48,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:48,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:48,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:48,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:48,496 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:48,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:48,510 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:48,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:48,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:48,511 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:48,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:48,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 05:22:48,543 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,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 05:22:48,544 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:48,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:48,544 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:48,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:48,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,568 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:48,568 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:22:48,569 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 05:22:48,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:48,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:48,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:48,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:48,719 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:48,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 05:22:48,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:48,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 05:22:48,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2022-12-06 05:22:48,719 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 05:22:48,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash -505530813, now seen corresponding path program 1 times [2022-12-06 05:22:48,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:48,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407579810] [2022-12-06 05:22:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:48,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407579810] [2022-12-06 05:22:48,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407579810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:48,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:48,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807338623] [2022-12-06 05:22:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:48,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:48,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:48,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:48,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 05:22:48,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:48,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:48,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:49,073 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:49,074 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:49,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 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 05:22:49,085 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:49,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:49,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:49,086 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:49,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:49,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 05:22:49,114 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,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 05:22:49,114 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:49,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:49,114 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:49,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:49,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,139 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:49,139 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:22:49,140 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 05:22:49,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:49,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:49,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:22:49,299 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:49,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 05:22:49,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:49,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 05:22:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2022-12-06 05:22:49,299 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 05:22:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1237279522, now seen corresponding path program 1 times [2022-12-06 05:22:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438033699] [2022-12-06 05:22:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:49,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 05:22:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:49,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438033699] [2022-12-06 05:22:49,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438033699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:49,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:49,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287747796] [2022-12-06 05:22:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:49,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:49,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:49,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:49,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:49,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:49,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:49,626 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:49,626 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:49,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 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 05:22:49,641 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:49,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:49,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:49,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 05:22:49,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:49,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 05:22:49,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,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 05:22:49,678 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:49,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:49,678 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:49,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:49,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:49,704 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:22:49,705 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 05:22:49,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:49,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:49,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:49,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:22:49,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:49,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 05:22:49,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:49,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 05:22:49,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2022-12-06 05:22:49,859 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 05:22:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1314877439, now seen corresponding path program 1 times [2022-12-06 05:22:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:49,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105355148] [2022-12-06 05:22:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:49,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 05:22:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105355148] [2022-12-06 05:22:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105355148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:49,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147252530] [2022-12-06 05:22:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:49,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:49,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 05:22:49,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:49,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:49,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:50,205 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:50,205 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:50,212 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 05:22:50,220 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:50,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:50,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:50,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:50,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 05:22:50,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:50,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 05:22:50,255 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:50,255 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:50,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:50,255 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:50,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:50,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,280 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:50,280 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:22:50,281 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 05:22:50,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:50,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:50,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:22:50,431 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:50,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:50,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:50,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:50,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2022-12-06 05:22:50,431 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 05:22:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 427932896, now seen corresponding path program 1 times [2022-12-06 05:22:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496777707] [2022-12-06 05:22:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:50,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 05:22:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:50,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496777707] [2022-12-06 05:22:50,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496777707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:50,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:50,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273556094] [2022-12-06 05:22:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:50,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:50,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:50,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 05:22:50,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:50,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:50,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:50,767 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:50,768 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:50,774 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 05:22:50,782 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:50,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:50,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:50,783 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:50,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:50,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 05:22:50,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,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 05:22:50,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:50,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:50,814 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:50,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:50,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,839 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:50,839 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:22:50,840 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 05:22:50,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:50,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:50,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:50,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:50,985 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:50,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 05:22:50,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:50,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 05:22:50,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2022-12-06 05:22:50,985 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 05:22:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2124224065, now seen corresponding path program 1 times [2022-12-06 05:22:50,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:50,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258091395] [2022-12-06 05:22:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:51,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 05:22:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:51,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258091395] [2022-12-06 05:22:51,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258091395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:51,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:51,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170215452] [2022-12-06 05:22:51,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:51,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:51,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:51,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:51,069 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:51,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 05:22:51,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:51,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:51,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:51,362 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:51,363 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:51,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 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 05:22:51,377 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:51,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:51,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:51,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 05:22:51,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:51,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 05:22:51,411 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,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 05:22:51,411 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:51,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:51,411 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:51,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:51,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,438 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:51,438 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:51,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 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 05:22:51,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:51,596 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:51,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:22:51,596 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:51,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 05:22:51,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:51,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 05:22:51,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2022-12-06 05:22:51,597 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 05:22:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash -381413730, now seen corresponding path program 1 times [2022-12-06 05:22:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:51,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750460124] [2022-12-06 05:22:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:51,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 05:22:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750460124] [2022-12-06 05:22:51,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750460124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:51,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512356662] [2022-12-06 05:22:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:51,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:51,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:51,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:51,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 05:22:51,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:51,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:51,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:51,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:51,946 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:51,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 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 05:22:51,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:51,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:51,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:51,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 05:22:51,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:51,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 05:22:51,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,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 05:22:51,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:51,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:51,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:51,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:51,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:51,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,020 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:52,020 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:52,021 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 05:22:52,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:52,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:52,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:22:52,181 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:52,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:52,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:52,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:52,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2022-12-06 05:22:52,181 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 05:22:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1361396605, now seen corresponding path program 1 times [2022-12-06 05:22:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539362435] [2022-12-06 05:22:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539362435] [2022-12-06 05:22:52,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539362435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:52,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:52,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39911918] [2022-12-06 05:22:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:52,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:52,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:52,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:52,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:52,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:52,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:52,543 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:52,543 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:52,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 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 05:22:52,558 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:52,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:52,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:52,559 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:52,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:52,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 05:22:52,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,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 05:22:52,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:52,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:52,592 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:52,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:52,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,616 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:52,616 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:52,617 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 05:22:52,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:52,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:52,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:52,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:22:52,777 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:52,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:52,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:52,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:52,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2022-12-06 05:22:52,777 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 05:22:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1190760356, now seen corresponding path program 1 times [2022-12-06 05:22:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:52,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612596850] [2022-12-06 05:22:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:52,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 05:22:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612596850] [2022-12-06 05:22:52,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612596850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:52,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:52,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809533062] [2022-12-06 05:22:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:52,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:52,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:52,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:52,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 05:22:52,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:52,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:53,119 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:53,119 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:22:53,125 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 05:22:53,133 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:53,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:53,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:53,134 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:53,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:53,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:53,167 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,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 05:22:53,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:53,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:53,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:53,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:53,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,192 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:53,192 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:22:53,193 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 05:22:53,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:53,353 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:53,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:22:53,354 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:53,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 05:22:53,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:53,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 05:22:53,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2022-12-06 05:22:53,354 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 05:22:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 552049979, now seen corresponding path program 1 times [2022-12-06 05:22:53,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:53,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563537442] [2022-12-06 05:22:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:53,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563537442] [2022-12-06 05:22:53,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563537442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:53,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:53,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015404462] [2022-12-06 05:22:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:53,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:53,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:53,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:53,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 05:22:53,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:53,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:53,729 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:53,729 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:22:53,735 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 05:22:53,741 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:53,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:53,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:53,741 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:53,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:53,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:53,772 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:53,772 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:53,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:53,773 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:53,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:53,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,805 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:22:53,805 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:22:53,806 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 05:22:53,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:53,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:53,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:53,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:22:53,972 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:53,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 05:22:53,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:53,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 05:22:53,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2022-12-06 05:22:53,972 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 05:22:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2000106982, now seen corresponding path program 1 times [2022-12-06 05:22:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:53,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139208670] [2022-12-06 05:22:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:54,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 05:22:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:54,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139208670] [2022-12-06 05:22:54,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139208670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:54,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:54,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070293493] [2022-12-06 05:22:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:54,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:54,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:54,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 05:22:54,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:54,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:54,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:54,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:54,293 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:22:54,300 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 05:22:54,307 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:54,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:54,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:54,308 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:54,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:54,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 05:22:54,339 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,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 05:22:54,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:54,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:54,340 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:54,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:54,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,364 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:54,364 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:22:54,365 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 05:22:54,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:54,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:54,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:22:54,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:54,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 05:22:54,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:54,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 05:22:54,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2022-12-06 05:22:54,511 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 05:22:54,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash -257296647, now seen corresponding path program 1 times [2022-12-06 05:22:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948664900] [2022-12-06 05:22:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:54,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:54,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 05:22:54,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:54,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948664900] [2022-12-06 05:22:54,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948664900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:54,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:54,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716500269] [2022-12-06 05:22:54,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:54,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:54,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:54,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 05:22:54,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:54,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:54,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:54,848 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:54,848 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:54,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:54,862 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:54,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:54,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:54,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:54,863 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:54,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:54,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 05:22:54,895 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,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 05:22:54,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:54,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:54,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:54,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:54,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:54,921 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:22:54,922 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 05:22:54,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:54,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:55,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:55,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:22:55,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:55,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 05:22:55,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:55,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:55,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2022-12-06 05:22:55,070 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 05:22:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1485513688, now seen corresponding path program 1 times [2022-12-06 05:22:55,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:55,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648249914] [2022-12-06 05:22:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:55,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 05:22:55,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:55,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648249914] [2022-12-06 05:22:55,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648249914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:55,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:55,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467906663] [2022-12-06 05:22:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:55,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:55,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:55,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:55,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:55,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 05:22:55,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:55,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:55,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:55,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:55,417 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:55,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 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 05:22:55,431 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:55,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:55,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:55,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 05:22:55,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:55,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 05:22:55,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:55,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 05:22:55,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:55,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:55,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:55,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:55,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:55,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:55,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:55,489 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:55,490 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:22:55,491 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 05:22:55,492 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:55,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:55,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:55,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:22:55,631 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:55,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 05:22:55,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:55,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 05:22:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2022-12-06 05:22:55,632 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 05:22:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1066643273, now seen corresponding path program 1 times [2022-12-06 05:22:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:55,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856219945] [2022-12-06 05:22:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:55,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 05:22:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856219945] [2022-12-06 05:22:55,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856219945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:55,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:55,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291211153] [2022-12-06 05:22:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:55,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:55,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:55,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:55,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 05:22:55,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:55,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:55,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:55,962 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:55,962 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:55,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:55,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:55,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:55,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:55,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 05:22:55,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:56,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 05:22:56,012 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:22:56,012 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:56,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:56,013 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:56,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:56,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,038 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:56,038 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:22:56,039 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 05:22:56,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:56,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:56,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:22:56,196 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:56,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:56,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:56,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:56,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2022-12-06 05:22:56,197 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 05:22:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 676167062, now seen corresponding path program 1 times [2022-12-06 05:22:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:56,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665438931] [2022-12-06 05:22:56,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:56,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:56,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665438931] [2022-12-06 05:22:56,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665438931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:56,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:56,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799853481] [2022-12-06 05:22:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:56,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:56,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:56,257 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:56,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:56,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:56,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:56,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:56,531 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:56,531 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:56,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:22:56,545 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:56,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:56,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:56,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 05:22:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:56,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:56,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,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 05:22:56,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:56,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:56,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:56,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:56,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:56,604 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:56,605 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 05:22:56,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:56,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:56,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:56,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 05:22:56,810 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:56,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 05:22:56,811 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:56,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 05:22:56,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2022-12-06 05:22:56,811 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 05:22:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1875989899, now seen corresponding path program 1 times [2022-12-06 05:22:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:56,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005983015] [2022-12-06 05:22:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:56,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 05:22:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:56,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005983015] [2022-12-06 05:22:56,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005983015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:56,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:56,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:56,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722840648] [2022-12-06 05:22:56,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:56,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:56,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:56,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 05:22:56,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:56,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:57,176 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:57,176 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:57,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 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 05:22:57,190 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:57,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:57,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:57,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 05:22:57,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:57,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:57,223 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,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 05:22:57,224 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:57,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:57,224 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:57,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:57,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,248 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:57,249 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:22:57,249 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 05:22:57,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:57,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:57,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:22:57,410 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:57,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 05:22:57,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:57,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 05:22:57,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2022-12-06 05:22:57,410 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 05:22:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:57,411 INFO L85 PathProgramCache]: Analyzing trace with hash -133179564, now seen corresponding path program 1 times [2022-12-06 05:22:57,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:57,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926658378] [2022-12-06 05:22:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:57,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:57,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926658378] [2022-12-06 05:22:57,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926658378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:57,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:57,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272062744] [2022-12-06 05:22:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:57,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:57,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:57,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:57,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:57,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:57,751 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:57,751 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:57,758 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 05:22:57,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:57,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:57,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:57,766 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:57,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:57,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 05:22:57,798 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,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 05:22:57,798 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:57,798 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:57,798 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:57,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:57,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,823 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:57,823 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:22:57,824 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 05:22:57,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:57,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:57,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:57,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:22:57,968 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:57,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 05:22:57,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:57,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 05:22:57,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2022-12-06 05:22:57,968 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 05:22:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:57,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1609630771, now seen corresponding path program 1 times [2022-12-06 05:22:57,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:57,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069778674] [2022-12-06 05:22:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:57,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:58,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 05:22:58,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:58,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069778674] [2022-12-06 05:22:58,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069778674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:58,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:58,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107516054] [2022-12-06 05:22:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:58,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:58,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:58,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 05:22:58,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:58,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:58,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:58,312 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:58,312 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:58,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:22:58,324 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:58,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:58,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:58,325 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:58,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:58,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 05:22:58,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,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 05:22:58,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:58,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:58,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:58,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:58,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,379 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:58,379 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:22:58,380 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 05:22:58,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:58,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:58,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:22:58,525 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:58,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 05:22:58,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:58,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:58,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2022-12-06 05:22:58,525 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 05:22:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -942526190, now seen corresponding path program 1 times [2022-12-06 05:22:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695563177] [2022-12-06 05:22:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:58,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 05:22:58,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:58,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695563177] [2022-12-06 05:22:58,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695563177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:58,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:58,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697501225] [2022-12-06 05:22:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:58,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:58,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:58,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:58,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 05:22:58,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:58,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:58,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:58,875 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:58,875 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:22:58,885 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 05:22:58,892 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:58,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:58,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:58,893 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:22:58,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:58,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 05:22:58,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,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 05:22:58,925 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:58,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:58,925 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:58,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:58,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,950 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:58,951 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:22:58,951 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 05:22:58,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:58,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:59,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:59,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:22:59,101 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:59,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:59,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:59,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:59,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2022-12-06 05:22:59,102 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 05:22:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 800284145, now seen corresponding path program 1 times [2022-12-06 05:22:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:59,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375879255] [2022-12-06 05:22:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:59,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 05:22:59,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375879255] [2022-12-06 05:22:59,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375879255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:59,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:59,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:59,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435244340] [2022-12-06 05:22:59,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:59,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:59,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:59,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:59,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:59,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:59,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:59,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:59,440 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:59,440 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:59,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 05:22:59,454 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:22:59,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:22:59,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:22:59,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 05:22:59,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:22:59,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 05:22:59,488 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:59,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 05:22:59,488 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:22:59,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:59,488 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:59,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:59,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:59,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:59,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:59,513 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:22:59,514 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:22:59,515 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 05:22:59,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:22:59,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:22:59,662 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:59,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:22:59,663 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:22:59,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 05:22:59,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:59,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 05:22:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2022-12-06 05:22:59,663 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 05:22:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1751872816, now seen corresponding path program 1 times [2022-12-06 05:22:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314213517] [2022-12-06 05:22:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314213517] [2022-12-06 05:22:59,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314213517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:59,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:59,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:22:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938921896] [2022-12-06 05:22:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:59,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:59,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:22:59,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:59,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:59,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:22:59,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:59,990 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:22:59,990 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:22:59,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:00,005 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:00,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:00,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:00,006 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:00,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:00,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 05:23:00,038 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,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 05:23:00,038 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:00,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:00,038 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:00,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:00,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,063 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:00,064 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:23:00,064 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 05:23:00,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:00,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:00,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:23:00,210 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:00,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:00,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:00,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2022-12-06 05:23:00,211 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 05:23:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash -9062481, now seen corresponding path program 1 times [2022-12-06 05:23:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:00,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950507664] [2022-12-06 05:23:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:00,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:00,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:00,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950507664] [2022-12-06 05:23:00,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950507664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:00,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:00,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070879395] [2022-12-06 05:23:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:00,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:00,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:00,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:00,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:00,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:00,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:00,554 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:00,554 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:00,561 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 05:23:00,568 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:00,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:00,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:00,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 05:23:00,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:00,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 05:23:00,602 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,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 05:23:00,602 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:00,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:00,602 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:00,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:00,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,627 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:00,627 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:00,628 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 05:23:00,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:00,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:00,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:00,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:23:00,778 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:00,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 05:23:00,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:00,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 05:23:00,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2022-12-06 05:23:00,778 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 05:23:00,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1733747854, now seen corresponding path program 1 times [2022-12-06 05:23:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:00,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640185125] [2022-12-06 05:23:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640185125] [2022-12-06 05:23:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640185125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:00,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:00,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171672854] [2022-12-06 05:23:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:00,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:00,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:00,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:00,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 05:23:00,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:00,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:00,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:01,112 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:01,112 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:01,119 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 05:23:01,126 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:01,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:01,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:01,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:01,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 05:23:01,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:01,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 05:23:01,160 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,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 05:23:01,160 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:01,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:01,160 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,161 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:01,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:01,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,195 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:01,195 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:23:01,196 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 05:23:01,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:01,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:01,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:23:01,351 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:01,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:01,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:01,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:01,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2022-12-06 05:23:01,351 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 05:23:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -818409107, now seen corresponding path program 1 times [2022-12-06 05:23:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:01,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940305065] [2022-12-06 05:23:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:01,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 05:23:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:01,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940305065] [2022-12-06 05:23:01,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940305065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:01,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:01,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175280275] [2022-12-06 05:23:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:01,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:01,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:01,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:01,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 05:23:01,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:01,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:01,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:01,690 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:01,690 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:23:01,697 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 05:23:01,704 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:01,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:01,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:01,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 05:23:01,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:01,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:01,737 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,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 05:23:01,738 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:01,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:01,738 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:01,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:01,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,762 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:01,762 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:23:01,763 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 05:23:01,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:01,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:01,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:01,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:01,911 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:01,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:01,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:01,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:01,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2022-12-06 05:23:01,911 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 05:23:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 924401228, now seen corresponding path program 1 times [2022-12-06 05:23:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97636637] [2022-12-06 05:23:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97636637] [2022-12-06 05:23:01,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97636637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:01,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:01,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450950868] [2022-12-06 05:23:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:01,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:01,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:01,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 05:23:01,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:01,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:01,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:02,258 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:02,258 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:02,264 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 05:23:02,271 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:02,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:02,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:02,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 05:23:02,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:02,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:02,304 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:02,305 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:02,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:02,305 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:02,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:02,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,330 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:02,330 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:23:02,331 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 05:23:02,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:02,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:02,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:23:02,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:02,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 05:23:02,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:02,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 05:23:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2022-12-06 05:23:02,493 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 05:23:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1627755733, now seen corresponding path program 1 times [2022-12-06 05:23:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156507676] [2022-12-06 05:23:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:02,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 05:23:02,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:02,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156507676] [2022-12-06 05:23:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156507676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:02,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:02,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971274696] [2022-12-06 05:23:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:02,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:02,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:02,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 05:23:02,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:02,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:02,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:02,842 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:02,842 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:02,847 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 05:23:02,853 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:02,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:02,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:02,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 05:23:02,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:02,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 05:23:02,882 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,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 05:23:02,882 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:02,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:02,882 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:02,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:02,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,906 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:02,906 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:23:02,907 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 05:23:02,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:02,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:03,060 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:03,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:23:03,061 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:03,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 05:23:03,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:03,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 05:23:03,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2022-12-06 05:23:03,061 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 05:23:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash 115054602, now seen corresponding path program 1 times [2022-12-06 05:23:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:03,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473218056] [2022-12-06 05:23:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473218056] [2022-12-06 05:23:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473218056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:03,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:03,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805993935] [2022-12-06 05:23:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:03,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:03,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:03,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 05:23:03,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:03,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:03,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:03,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:03,384 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:03,390 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 05:23:03,397 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:03,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:03,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:03,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 05:23:03,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:03,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 05:23:03,428 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,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 05:23:03,428 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:03,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:03,428 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:03,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:03,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,453 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:03,453 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:03,454 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 05:23:03,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:03,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:03,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:03,603 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:03,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 05:23:03,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:03,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 05:23:03,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2022-12-06 05:23:03,604 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 05:23:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1857864937, now seen corresponding path program 1 times [2022-12-06 05:23:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:03,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51564636] [2022-12-06 05:23:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:03,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 05:23:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51564636] [2022-12-06 05:23:03,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51564636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:03,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693813768] [2022-12-06 05:23:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:03,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:03,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:03,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:03,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 05:23:03,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:03,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:03,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:03,942 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:03,942 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:03,949 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 05:23:03,956 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:03,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:03,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:03,957 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:03,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:03,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 05:23:03,988 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,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 05:23:03,988 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:03,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:03,988 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,988 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:03,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:03,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:03,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,015 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:04,015 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:23:04,016 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 05:23:04,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:04,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:04,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:23:04,170 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:04,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 05:23:04,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:04,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 05:23:04,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2022-12-06 05:23:04,171 INFO L420 AbstractCegarLoop]: === Iteration 725 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:23:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash -694292024, now seen corresponding path program 1 times [2022-12-06 05:23:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:04,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938859257] [2022-12-06 05:23:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:04,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 05:23:04,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:04,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938859257] [2022-12-06 05:23:04,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938859257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:04,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:04,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979194757] [2022-12-06 05:23:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:04,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:04,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:04,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:04,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:04,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 05:23:04,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:04,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:04,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:04,498 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:04,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 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 05:23:04,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:04,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:04,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:04,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 05:23:04,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:04,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 05:23:04,545 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,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 05:23:04,545 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:04,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:04,545 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:04,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:04,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,570 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:04,570 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:23:04,571 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 05:23:04,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:04,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:04,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:04,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:04,728 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:04,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 05:23:04,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:04,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 05:23:04,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2022-12-06 05:23:04,728 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 05:23:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1048518311, now seen corresponding path program 1 times [2022-12-06 05:23:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:04,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653034905] [2022-12-06 05:23:04,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:04,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 05:23:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653034905] [2022-12-06 05:23:04,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653034905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:04,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125446038] [2022-12-06 05:23:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:04,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:04,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:04,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 05:23:04,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:04,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:05,074 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:05,075 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:05,081 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 05:23:05,088 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:05,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:05,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:05,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:05,089 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:05,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:05,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:05,120 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,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 05:23:05,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:05,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:05,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:05,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:05,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,144 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:05,145 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:23:05,146 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 05:23:05,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:05,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:05,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:05,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:05,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 05:23:05,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:05,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 05:23:05,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2022-12-06 05:23:05,297 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 05:23:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1503638650, now seen corresponding path program 1 times [2022-12-06 05:23:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:05,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734545263] [2022-12-06 05:23:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:05,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 05:23:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734545263] [2022-12-06 05:23:05,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734545263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:05,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:05,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257629673] [2022-12-06 05:23:05,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:05,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:05,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 05:23:05,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:05,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:05,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:05,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:05,621 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:05,627 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 05:23:05,634 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:05,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:05,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:05,635 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:05,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:05,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 05:23:05,667 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,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 05:23:05,668 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:05,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:05,668 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:05,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:05,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,693 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:05,693 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:23:05,694 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 05:23:05,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:05,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:05,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:05,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:23:05,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:05,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:05,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:05,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:05,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2022-12-06 05:23:05,857 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 05:23:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash 239171685, now seen corresponding path program 1 times [2022-12-06 05:23:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:05,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171396069] [2022-12-06 05:23:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:05,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:05,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171396069] [2022-12-06 05:23:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171396069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:05,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:05,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937511335] [2022-12-06 05:23:05,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:05,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:05,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:05,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:05,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 05:23:05,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:05,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:05,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:06,199 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:06,199 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:06,206 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 05:23:06,213 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:06,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:06,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:06,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 05:23:06,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:06,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 05:23:06,248 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,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 05:23:06,248 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:06,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:06,248 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:06,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:06,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,273 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:06,273 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:06,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 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 05:23:06,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:06,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:06,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:23:06,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:06,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 05:23:06,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:06,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 05:23:06,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2022-12-06 05:23:06,421 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 05:23:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1981982020, now seen corresponding path program 1 times [2022-12-06 05:23:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:06,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70930843] [2022-12-06 05:23:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:06,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:06,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 05:23:06,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70930843] [2022-12-06 05:23:06,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70930843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:06,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722344857] [2022-12-06 05:23:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:06,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:06,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:06,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:06,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 05:23:06,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:06,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:06,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:06,772 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:06,773 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:06,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:06,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:06,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:06,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:06,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:06,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 05:23:06,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:06,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 05:23:06,817 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,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 05:23:06,818 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:06,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:06,818 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:06,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:06,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,842 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:06,842 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:23:06,843 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 05:23:06,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:06,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:06,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:06,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:06,995 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:06,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 05:23:06,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:06,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 05:23:06,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2022-12-06 05:23:06,995 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 05:23:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash -570174941, now seen corresponding path program 1 times [2022-12-06 05:23:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:06,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715463985] [2022-12-06 05:23:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715463985] [2022-12-06 05:23:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715463985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:07,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356371394] [2022-12-06 05:23:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:07,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:07,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:07,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:07,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:07,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:07,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:07,353 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:07,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:07,365 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:07,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:07,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:07,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 05:23:07,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:07,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 05:23:07,392 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,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 05:23:07,393 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:07,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:07,393 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,393 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:07,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:07,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,417 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:07,418 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:23:07,418 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 05:23:07,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:07,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:07,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:23:07,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23: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 05:23:07,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:07,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:07,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2022-12-06 05:23:07,570 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 05:23:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1172635394, now seen corresponding path program 1 times [2022-12-06 05:23:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:07,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887753768] [2022-12-06 05:23:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:07,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 05:23:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:07,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887753768] [2022-12-06 05:23:07,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887753768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:07,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:07,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561560003] [2022-12-06 05:23:07,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:07,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:07,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:07,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:07,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 05:23:07,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:07,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:07,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:07,914 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:07,914 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:07,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 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 05:23:07,927 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:07,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:07,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:07,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 05:23:07,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:07,959 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:07,960 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:07,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:07,960 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:07,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:07,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,984 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:07,984 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:23:07,985 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 05:23:07,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:07,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:08,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:08,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:23:08,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:08,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 05:23:08,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:08,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 05:23:08,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2022-12-06 05:23:08,131 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 05:23:08,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1379521567, now seen corresponding path program 1 times [2022-12-06 05:23:08,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:08,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159413353] [2022-12-06 05:23:08,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:08,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:08,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159413353] [2022-12-06 05:23:08,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159413353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:08,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:08,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474997] [2022-12-06 05:23:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:08,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:08,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:08,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:08,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:08,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:08,454 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:08,454 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:23:08,462 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 05:23:08,469 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:08,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:08,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:08,469 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:08,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:08,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 05:23:08,500 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:08,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 05:23:08,500 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:08,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:08,500 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:08,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:08,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:08,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:08,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:08,525 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:08,525 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:23:08,526 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 05:23:08,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:08,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:08,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:08,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:08,675 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:08,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 05:23:08,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:08,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 05:23:08,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2022-12-06 05:23:08,675 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 05:23:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 363288768, now seen corresponding path program 1 times [2022-12-06 05:23:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:08,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384102130] [2022-12-06 05:23:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:08,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384102130] [2022-12-06 05:23:08,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384102130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:08,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:08,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:08,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833018844] [2022-12-06 05:23:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:08,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:08,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:08,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:08,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:08,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:08,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:08,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:09,026 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:09,026 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:09,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:09,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:09,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:09,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:09,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 05:23:09,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:09,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:09,073 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:09,073 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:09,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:09,073 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:09,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:09,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,098 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:09,098 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:09,099 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 05:23:09,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:09,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:09,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:23:09,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:09,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 05:23:09,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:09,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 05:23:09,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2022-12-06 05:23:09,254 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 05:23:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2106099103, now seen corresponding path program 1 times [2022-12-06 05:23:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:09,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994723802] [2022-12-06 05:23:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:09,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:09,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994723802] [2022-12-06 05:23:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994723802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:09,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:09,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71232319] [2022-12-06 05:23:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:09,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:09,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:09,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:09,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:09,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:09,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:09,597 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:09,598 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:09,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 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 05:23:09,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:09,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:09,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:09,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 05:23:09,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:09,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:09,646 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,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 05:23:09,647 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:09,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:09,647 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,647 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:09,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:09,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,672 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:09,672 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:09,673 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 05:23:09,675 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:09,675 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:09,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:09,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:23:09,816 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:09,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 05:23:09,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:09,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 05:23:09,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2022-12-06 05:23:09,816 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 05:23:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -446057858, now seen corresponding path program 1 times [2022-12-06 05:23:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:09,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571092044] [2022-12-06 05:23:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:09,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:09,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571092044] [2022-12-06 05:23:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571092044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:09,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523734785] [2022-12-06 05:23:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:09,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:09,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 05:23:09,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:09,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:09,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:10,160 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:10,160 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:23:10,166 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 05:23:10,174 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:10,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:10,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:10,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 05:23:10,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:10,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 05:23:10,205 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,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 05:23:10,205 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:10,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:10,205 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:10,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:10,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,240 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:10,240 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:23:10,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 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 05:23:10,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:10,389 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:10,390 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:23:10,390 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:10,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 05:23:10,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:10,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 05:23:10,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2022-12-06 05:23:10,390 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 05:23:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1296752477, now seen corresponding path program 1 times [2022-12-06 05:23:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:10,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984754414] [2022-12-06 05:23:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:10,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 05:23:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:10,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984754414] [2022-12-06 05:23:10,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984754414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:10,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:10,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065356091] [2022-12-06 05:23:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:10,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:10,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:10,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:10,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:10,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 05:23:10,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:10,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:10,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:10,730 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:10,730 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:10,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:10,745 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:10,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:10,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:10,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 05:23:10,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:10,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 05:23:10,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,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 05:23:10,780 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:10,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:10,781 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:10,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:10,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,806 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:10,806 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:10,807 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 05:23:10,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:10,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:10,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:10,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:10,955 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:10,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:10,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:10,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:10,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2022-12-06 05:23:10,955 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 05:23:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1255404484, now seen corresponding path program 1 times [2022-12-06 05:23:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:10,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634106328] [2022-12-06 05:23:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:11,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 05:23:11,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:11,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634106328] [2022-12-06 05:23:11,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634106328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:11,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:11,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345720623] [2022-12-06 05:23:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:11,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:11,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:11,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:11,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:11,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:11,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:11,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:11,302 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:11,302 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:11,308 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 05:23:11,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:11,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:11,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:11,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 05:23:11,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:11,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:11,349 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:11,349 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:11,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:11,349 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:11,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:11,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,374 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:11,375 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:23:11,376 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 05:23:11,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:11,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:11,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:23:11,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:11,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 05:23:11,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:11,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 05:23:11,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2022-12-06 05:23:11,524 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 05:23:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash 487405851, now seen corresponding path program 1 times [2022-12-06 05:23:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:11,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591909407] [2022-12-06 05:23:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:11,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:11,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 05:23:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591909407] [2022-12-06 05:23:11,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591909407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:11,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648382688] [2022-12-06 05:23:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:11,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:11,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:11,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:11,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:11,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 05:23:11,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:11,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:11,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:11,873 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:11,873 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:11,879 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 05:23:11,884 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:11,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:11,885 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:11,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 05:23:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:11,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 05:23:11,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:11,915 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:11,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:11,915 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:11,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:11,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,940 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:11,940 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:23:11,941 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 05:23:11,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:11,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:12,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:12,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:23:12,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:12,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 05:23:12,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:12,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 05:23:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2022-12-06 05:23:12,086 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 05:23:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2064751110, now seen corresponding path program 1 times [2022-12-06 05:23:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:12,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180821950] [2022-12-06 05:23:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:12,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 05:23:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:12,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180821950] [2022-12-06 05:23:12,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180821950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:12,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:12,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227306152] [2022-12-06 05:23:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:12,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:12,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:12,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:12,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:12,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:12,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:12,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:12,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:12,526 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:12,526 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:12,533 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 05:23:12,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:12,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:12,541 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:12,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 05:23:12,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:12,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:12,572 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:12,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:12,572 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:12,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:12,572 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:12,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:12,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:12,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:12,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:12,597 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:12,597 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:12,598 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 05:23:12,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:12,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:12,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:12,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:12,749 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:12,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 05:23:12,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:12,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 05:23:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2022-12-06 05:23:12,749 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 05:23:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -321940775, now seen corresponding path program 1 times [2022-12-06 05:23:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178082669] [2022-12-06 05:23:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:12,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 05:23:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:12,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178082669] [2022-12-06 05:23:12,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178082669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:12,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:12,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356774724] [2022-12-06 05:23:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:12,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:12,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:12,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:12,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:12,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 05:23:12,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:12,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:12,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:13,073 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:13,073 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:13,080 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 05:23:13,088 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:13,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:13,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:13,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 05:23:13,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:13,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 05:23:13,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,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 05:23:13,119 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:13,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:13,119 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:13,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:13,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,144 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:13,144 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:13,145 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 05:23:13,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:13,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:13,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:13,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:13,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:13,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:13,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2022-12-06 05:23:13,302 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 05:23:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1420869560, now seen corresponding path program 1 times [2022-12-06 05:23:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:13,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756395217] [2022-12-06 05:23:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:13,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 05:23:13,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:13,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756395217] [2022-12-06 05:23:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756395217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:13,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:13,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725462068] [2022-12-06 05:23:13,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:13,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:13,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:13,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 05:23:13,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:13,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:13,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:13,646 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:13,646 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:13,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:23:13,660 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:13,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:13,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:13,661 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:13,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:13,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:13,694 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:13,695 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:13,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:13,695 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,695 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:13,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:13,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,720 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:13,720 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:13,721 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 05:23:13,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:13,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:13,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:13,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:23:13,876 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:13,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 05:23:13,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:13,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 05:23:13,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2022-12-06 05:23:13,876 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 05:23:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1131287401, now seen corresponding path program 1 times [2022-12-06 05:23:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:13,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237187435] [2022-12-06 05:23:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:13,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:13,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237187435] [2022-12-06 05:23:13,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237187435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:13,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:13,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061436780] [2022-12-06 05:23:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:13,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:13,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:13,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:13,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:13,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:14,221 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:14,221 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:14,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:14,238 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:14,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:14,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:14,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 05:23:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:14,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 05:23:14,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,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 05:23:14,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:14,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:14,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:14,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:14,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,298 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:14,299 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:23:14,299 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 05:23:14,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:14,455 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:14,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:14,456 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:14,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:14,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:14,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:14,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2022-12-06 05:23:14,456 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 05:23:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 611522934, now seen corresponding path program 1 times [2022-12-06 05:23:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:14,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786245171] [2022-12-06 05:23:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:14,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786245171] [2022-12-06 05:23:14,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786245171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:14,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:14,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559563791] [2022-12-06 05:23:14,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:14,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:14,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:14,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 05:23:14,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:14,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:14,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:14,794 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:14,794 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:14,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:14,809 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:14,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:14,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:14,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 05:23:14,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:14,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 05:23:14,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,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 05:23:14,842 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:14,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:14,842 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:14,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:14,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,876 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:14,877 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:14,878 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 05:23:14,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:14,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:15,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:15,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:23:15,029 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:15,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:15,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:15,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 05:23:15,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2022-12-06 05:23:15,029 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 05:23:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1940634027, now seen corresponding path program 1 times [2022-12-06 05:23:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:15,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022763994] [2022-12-06 05:23:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:15,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022763994] [2022-12-06 05:23:15,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022763994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:15,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:15,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203605967] [2022-12-06 05:23:15,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:15,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:15,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:15,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:15,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:15,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:15,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:15,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:15,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:15,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:15,374 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:15,388 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:15,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:15,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:15,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 05:23:15,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:15,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 05:23:15,422 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,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 05:23:15,422 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:15,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:15,422 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:15,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:15,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,448 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:15,448 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:23:15,449 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 05:23:15,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:15,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:15,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:23:15,592 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:15,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 05:23:15,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:15,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 05:23:15,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2022-12-06 05:23:15,592 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 05:23:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash -197823692, now seen corresponding path program 1 times [2022-12-06 05:23:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:15,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643840995] [2022-12-06 05:23:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:15,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 05:23:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:15,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643840995] [2022-12-06 05:23:15,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643840995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:15,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:15,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077767516] [2022-12-06 05:23:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:15,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:15,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:15,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 05:23:15,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:15,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:15,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:15,935 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:15,935 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:15,941 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 05:23:15,948 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:15,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:15,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:15,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 05:23:15,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:15,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 05:23:15,981 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,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 05:23:15,981 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:15,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:15,981 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:15,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:15,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:16,006 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:16,006 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:16,007 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 05:23:16,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:16,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:16,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:16,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:23:16,168 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:16,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 05:23:16,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:16,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2022-12-06 05:23:16,169 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 05:23:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1544986643, now seen corresponding path program 1 times [2022-12-06 05:23:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:16,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574382124] [2022-12-06 05:23:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:16,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:16,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574382124] [2022-12-06 05:23:16,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574382124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:16,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:16,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863801782] [2022-12-06 05:23:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:16,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:16,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:16,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:16,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:16,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:16,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:16,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:16,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:16,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:16,524 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:16,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:16,536 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:16,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:16,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:16,537 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:16,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23: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 05:23:16,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23: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 05:23:16,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:16,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:16,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:16,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:16,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:16,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:16,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:16,592 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:16,592 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:16,593 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 05:23:16,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:16,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:16,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:16,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:23:16,738 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23: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 05:23:16,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23: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 05:23:16,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2022-12-06 05:23:16,738 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 05:23:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1007170318, now seen corresponding path program 1 times [2022-12-06 05:23:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:16,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850040991] [2022-12-06 05:23:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23: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 05:23:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:16,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850040991] [2022-12-06 05:23:16,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850040991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:16,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:16,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939766185] [2022-12-06 05:23:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:16,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:16,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23: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 05:23:16,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:16,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:16,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:17,079 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:17,079 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:23:17,093 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:17,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:17,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:17,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 05:23:17,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:17,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 05:23:17,126 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,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 05:23:17,126 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:17,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:17,126 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,127 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:17,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:17,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,151 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:17,151 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:17,152 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 05:23:17,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:17,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:17,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:17,301 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:17,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 05:23:17,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:17,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 05:23:17,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2022-12-06 05:23:17,301 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 05:23:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:17,302 INFO L85 PathProgramCache]: Analyzing trace with hash 735640017, now seen corresponding path program 1 times [2022-12-06 05:23:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:17,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306524843] [2022-12-06 05:23:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:17,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 05:23:17,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:17,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306524843] [2022-12-06 05:23:17,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306524843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:17,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:17,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132629329] [2022-12-06 05:23:17,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:17,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:17,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:17,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:17,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:17,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:17,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 05:23:17,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:17,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:17,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:17,627 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:17,627 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:23:17,634 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 05:23:17,642 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:17,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:17,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:17,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 05:23:17,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:17,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 05:23:17,674 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,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 05:23:17,674 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:17,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:17,674 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:17,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:17,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,700 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:17,700 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:23:17,701 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 05:23:17,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:17,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:17,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:17,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:17,849 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:17,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 05:23:17,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:17,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 05:23:17,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2022-12-06 05:23:17,849 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 05:23:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1816516944, now seen corresponding path program 1 times [2022-12-06 05:23:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:17,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601589306] [2022-12-06 05:23:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:17,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 05:23:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:17,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601589306] [2022-12-06 05:23:17,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601589306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:17,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:17,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979644603] [2022-12-06 05:23:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:17,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:17,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:17,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 05:23:17,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:17,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:17,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:18,194 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:18,194 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:18,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 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 05:23:18,208 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:18,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:18,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:18,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 05:23:18,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23: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 05:23:18,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23: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 05:23:18,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:18,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:18,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:18,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:18,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,266 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:18,266 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:18,267 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 05:23:18,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:18,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:18,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:23:18,420 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:18,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:18,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2022-12-06 05:23:18,420 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 05:23:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash -73706609, now seen corresponding path program 1 times [2022-12-06 05:23:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:18,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262066280] [2022-12-06 05:23:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:18,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 05:23:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:18,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262066280] [2022-12-06 05:23:18,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262066280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:18,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:18,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971257362] [2022-12-06 05:23:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:18,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:18,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 05:23:18,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:18,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:18,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:18,746 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:18,746 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:18,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 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 05:23:18,760 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:18,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:18,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:18,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 05:23:18,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:18,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 05:23:18,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,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 05:23:18,793 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:18,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:18,793 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:18,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:18,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,818 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:18,818 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:23:18,819 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 05:23:18,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:18,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:18,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:18,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:23:18,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:18,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 05:23:18,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:18,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 05:23:18,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2022-12-06 05:23:18,988 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 05:23:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1669103726, now seen corresponding path program 1 times [2022-12-06 05:23:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:18,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362043124] [2022-12-06 05:23:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:18,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:19,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:19,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362043124] [2022-12-06 05:23:19,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362043124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:19,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:19,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164271203] [2022-12-06 05:23:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:19,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:19,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:19,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 05:23:19,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:19,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:19,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:19,334 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:19,334 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:19,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 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 05:23:19,349 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:19,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:19,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:19,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 05:23:19,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:19,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 05:23:19,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,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 05:23:19,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:19,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:19,387 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:19,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:19,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,419 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:19,419 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:23:19,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 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 05:23:19,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:19,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:19,562 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:19,562 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:19,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 05:23:19,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:19,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 05:23:19,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2022-12-06 05:23:19,562 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 05:23:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash -883053235, now seen corresponding path program 1 times [2022-12-06 05:23:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:19,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299706728] [2022-12-06 05:23:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:19,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299706728] [2022-12-06 05:23:19,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299706728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:19,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:19,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143080770] [2022-12-06 05:23:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:19,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:19,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:19,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:19,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:19,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:19,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:19,886 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:19,886 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:19,893 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 05:23:19,900 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:19,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:19,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:19,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 05:23:19,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:19,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 05:23:19,933 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,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 05:23:19,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:19,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:19,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:19,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:19,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,959 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:19,959 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:19,960 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 05:23:19,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:19,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:20,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:20,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:23:20,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:20,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 05:23:20,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:20,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 05:23:20,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2022-12-06 05:23:20,106 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 05:23:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 859757100, now seen corresponding path program 1 times [2022-12-06 05:23:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:20,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460571158] [2022-12-06 05:23:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:20,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460571158] [2022-12-06 05:23:20,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460571158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:20,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:20,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81687930] [2022-12-06 05:23:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:20,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:20,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:20,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:20,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:20,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:20,450 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:20,450 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:20,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 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 05:23:20,464 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:20,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:20,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:20,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 05:23:20,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:20,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 05:23:20,497 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:20,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 05:23:20,497 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:20,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:20,497 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:20,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:20,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:20,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:20,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:20,522 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:20,522 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:23:20,523 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 05:23:20,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:20,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:20,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:20,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:23:20,686 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:20,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 05:23:20,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:20,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 05:23:20,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2022-12-06 05:23:20,687 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 05:23:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1692399861, now seen corresponding path program 1 times [2022-12-06 05:23:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:20,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219651720] [2022-12-06 05:23:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:20,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219651720] [2022-12-06 05:23:20,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219651720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:20,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:20,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718792448] [2022-12-06 05:23:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:20,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:20,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:20,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:20,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:20,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 05:23:20,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:20,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:20,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:21,050 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:21,051 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:21,057 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 05:23:21,063 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:21,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:21,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:21,064 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:21,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:21,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 05:23:21,092 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,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 05:23:21,093 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:21,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:21,093 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:21,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:21,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,117 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:21,117 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:23:21,118 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 05:23:21,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:21,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:21,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:23:21,281 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:21,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 05:23:21,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:21,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 05:23:21,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2022-12-06 05:23:21,281 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 05:23:21,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash 50410474, now seen corresponding path program 1 times [2022-12-06 05:23:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:21,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809389050] [2022-12-06 05:23:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:21,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 05:23:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:21,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809389050] [2022-12-06 05:23:21,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809389050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:21,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:21,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389516054] [2022-12-06 05:23:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:21,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:21,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:21,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:21,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 05:23:21,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:21,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:21,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:21,617 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:21,617 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:23:21,624 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 05:23:21,631 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:21,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:21,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:21,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 05:23:21,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:21,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 05:23:21,663 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,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 05:23:21,664 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:21,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:21,664 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,664 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:21,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:21,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,689 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:21,689 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:21,690 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 05:23:21,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:21,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:21,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:21,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:23:21,844 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:21,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 05:23:21,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:21,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 05:23:21,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2022-12-06 05:23:21,844 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 05:23:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1793220809, now seen corresponding path program 1 times [2022-12-06 05:23:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:21,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44323735] [2022-12-06 05:23:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:21,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 05:23:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:21,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44323735] [2022-12-06 05:23:21,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44323735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:21,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:21,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461268193] [2022-12-06 05:23:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:21,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:21,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:21,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:21,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:21,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:21,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:22,200 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:22,200 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:22,207 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 05:23:22,214 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:22,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:22,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:22,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 05:23:22,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:22,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 05:23:22,248 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,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 05:23:22,248 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:22,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:22,248 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:22,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:22,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,273 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:22,273 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:22,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 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 05:23:22,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:22,431 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:22,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:23:22,432 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:22,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 05:23:22,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:22,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:22,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2022-12-06 05:23:22,432 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 05:23:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -758936152, now seen corresponding path program 1 times [2022-12-06 05:23:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994894207] [2022-12-06 05:23:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994894207] [2022-12-06 05:23:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994894207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:22,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:22,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944926193] [2022-12-06 05:23:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:22,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:22,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:22,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 05:23:22,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:22,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:22,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:22,765 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:22,765 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:22,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 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 05:23:22,779 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:22,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:22,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:22,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 05:23:22,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:22,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 05:23:22,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,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 05:23:22,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:22,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:22,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:22,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:22,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,838 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:22,838 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:23:22,839 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 05:23:22,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:22,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:22,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:22,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:23:22,991 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:22,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 05:23:22,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:22,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 05:23:22,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2022-12-06 05:23:22,992 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 05:23:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 983874183, now seen corresponding path program 1 times [2022-12-06 05:23:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:22,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011675713] [2022-12-06 05:23:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:23,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 05:23:23,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:23,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011675713] [2022-12-06 05:23:23,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011675713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:23,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:23,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570453187] [2022-12-06 05:23:23,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:23,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:23,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:23,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:23,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:23,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 05:23:23,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:23,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:23,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:23,313 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:23,313 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:23:23,320 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 05:23:23,327 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:23,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:23,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:23,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 05:23:23,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:23,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:23,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:23,357 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:23,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:23,357 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:23,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:23,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,381 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:23,381 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:23:23,382 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 05:23:23,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:23,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:23,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:23,540 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:23,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:23,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:23,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2022-12-06 05:23:23,541 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 05:23:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1568282778, now seen corresponding path program 1 times [2022-12-06 05:23:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:23,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89381090] [2022-12-06 05:23:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89381090] [2022-12-06 05:23:23,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89381090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:23,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:23,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948576128] [2022-12-06 05:23:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:23,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:23,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:23,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:23,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:23,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:23,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:23,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:23,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:23,882 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:23,882 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:23,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 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 05:23:23,895 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:23,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:23,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:23,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 05:23:23,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:23,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:23,926 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:23,926 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:23,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:23,926 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:23,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:23,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,959 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:23,959 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:23,960 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 05:23:23,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:23,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:24,109 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:24,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:24,109 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:24,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:24,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:24,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:24,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2022-12-06 05:23:24,109 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 05:23:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash 174527557, now seen corresponding path program 1 times [2022-12-06 05:23:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064757628] [2022-12-06 05:23:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:24,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 05:23:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:24,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064757628] [2022-12-06 05:23:24,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064757628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:24,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:24,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351402558] [2022-12-06 05:23:24,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:24,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:24,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:24,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 05:23:24,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:24,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:24,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:24,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:24,555 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:24,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:24,571 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:24,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:24,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:24,572 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:24,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:24,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 05:23:24,605 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:24,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 05:23:24,605 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:24,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:24,605 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:24,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:24,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:24,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:24,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:24,630 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:24,630 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:24,631 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 05:23:24,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:24,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:24,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:24,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:23:24,783 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:24,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 05:23:24,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:24,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 05:23:24,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2022-12-06 05:23:24,783 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 05:23:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1917337892, now seen corresponding path program 1 times [2022-12-06 05:23:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:24,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000393004] [2022-12-06 05:23:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:24,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 05:23:24,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:24,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000393004] [2022-12-06 05:23:24,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000393004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:24,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:24,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:24,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896753035] [2022-12-06 05:23:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:24,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:24,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:24,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:24,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 05:23:24,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:24,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:24,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:25,132 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:25,132 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:23:25,139 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 05:23:25,147 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:25,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:25,148 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:25,148 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:25,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:25,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:25,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:25,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:25,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:25,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:25,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,207 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:25,207 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:23:25,208 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 05:23:25,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:25,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:25,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:23:25,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:25,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 05:23:25,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:25,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 05:23:25,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2022-12-06 05:23:25,353 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 05:23:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -634819069, now seen corresponding path program 1 times [2022-12-06 05:23:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:25,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448419436] [2022-12-06 05:23:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:25,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:25,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 05:23:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:25,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448419436] [2022-12-06 05:23:25,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448419436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:25,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:25,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:25,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445222249] [2022-12-06 05:23:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:25,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:25,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:25,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 05:23:25,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:25,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:25,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:25,724 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:25,724 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:25,731 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 05:23:25,738 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:25,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:25,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:25,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 05:23:25,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:25,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 05:23:25,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,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 05:23:25,770 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:25,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:25,770 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:25,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:25,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,796 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:25,796 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:23:25,797 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 05:23:25,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:25,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:25,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:25,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:23:25,968 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:25,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 05:23:25,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:25,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 05:23:25,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2022-12-06 05:23:25,968 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 05:23:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:25,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1107991266, now seen corresponding path program 1 times [2022-12-06 05:23:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:25,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287942491] [2022-12-06 05:23:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:25,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:26,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 05:23:26,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:26,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287942491] [2022-12-06 05:23:26,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287942491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:26,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:26,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:26,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606494598] [2022-12-06 05:23:26,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:26,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:26,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:26,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:26,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 05:23:26,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:26,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:26,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:26,324 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:26,324 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:26,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:26,339 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:26,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:26,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:26,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 05:23:26,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:26,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 05:23:26,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,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 05:23:26,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:26,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:26,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:26,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:26,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,400 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:26,400 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:26,401 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 05:23:26,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:26,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:26,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:23:26,544 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:26,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 05:23:26,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:26,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 05:23:26,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2022-12-06 05:23:26,545 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 05:23:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:26,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1444165695, now seen corresponding path program 1 times [2022-12-06 05:23:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:26,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913860067] [2022-12-06 05:23:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:26,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 05:23:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913860067] [2022-12-06 05:23:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913860067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:26,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:26,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667483496] [2022-12-06 05:23:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:26,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:26,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:26,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:26,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 05:23:26,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:26,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:26,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:26,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:26,905 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:26,912 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 05:23:26,919 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:26,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:26,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:26,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 05:23:26,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:26,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 05:23:26,952 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,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 05:23:26,952 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:26,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:26,952 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:26,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:26,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,977 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:26,977 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:26,978 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 05:23:26,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:26,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:27,126 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:27,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:23:27,126 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:27,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 05:23:27,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:27,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 05:23:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2022-12-06 05:23:27,127 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 05:23:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 298644640, now seen corresponding path program 1 times [2022-12-06 05:23:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:27,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432058089] [2022-12-06 05:23:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:27,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432058089] [2022-12-06 05:23:27,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432058089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:27,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:27,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358701942] [2022-12-06 05:23:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:27,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:27,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:27,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:27,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:27,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:27,485 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:27,486 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:27,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:27,501 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:27,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:27,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:27,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 05:23:27,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:27,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 05:23:27,534 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:27,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 05:23:27,534 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:27,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:27,534 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:27,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:27,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:27,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:27,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:27,559 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:27,559 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:23:27,560 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 05:23:27,562 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:27,562 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:27,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:27,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:27,707 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:27,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 05:23:27,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:27,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 05:23:27,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2022-12-06 05:23:27,707 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 05:23:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2041454975, now seen corresponding path program 1 times [2022-12-06 05:23:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:27,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107467748] [2022-12-06 05:23:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:27,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 05:23:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:27,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107467748] [2022-12-06 05:23:27,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107467748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:27,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262215013] [2022-12-06 05:23:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:27,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:27,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:27,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:27,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:27,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 05:23:27,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:27,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:27,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:28,057 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:28,057 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:28,064 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 05:23:28,073 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:28,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:28,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:28,074 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:28,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:28,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 05:23:28,111 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:28,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:28,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:28,112 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:28,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:28,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,137 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:28,137 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:28,138 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 05:23:28,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:28,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:28,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:28,288 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:28,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 05:23:28,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:28,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 05:23:28,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2022-12-06 05:23:28,288 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 05:23:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash -510701986, now seen corresponding path program 1 times [2022-12-06 05:23:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:28,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860505091] [2022-12-06 05:23:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:28,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 05:23:28,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:28,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860505091] [2022-12-06 05:23:28,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860505091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:28,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:28,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970677756] [2022-12-06 05:23:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:28,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:28,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:28,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 05:23:28,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:28,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:28,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:28,638 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:28,638 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:28,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:28,653 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:28,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:28,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:28,654 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:28,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:28,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 05:23:28,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,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 05:23:28,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:28,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:28,715 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:28,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:28,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,740 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:28,741 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:28,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 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 05:23:28,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:28,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:28,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:28,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:23:28,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:28,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 05:23:28,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:28,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 05:23:28,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2022-12-06 05:23:28,895 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 05:23:28,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1232108349, now seen corresponding path program 1 times [2022-12-06 05:23:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:28,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649508082] [2022-12-06 05:23:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649508082] [2022-12-06 05:23:28,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649508082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:28,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:28,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325755308] [2022-12-06 05:23:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:28,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:28,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:28,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:28,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 05:23:28,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:28,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:28,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:29,246 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:29,246 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:29,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:29,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:29,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:29,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:29,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 05:23:29,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:29,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 05:23:29,294 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,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 05:23:29,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:29,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:29,294 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:29,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:29,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,331 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:29,331 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:29,333 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 05:23:29,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:29,479 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:29,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:23:29,482 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:29,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:29,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:29,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:29,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2022-12-06 05:23:29,482 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 05:23:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1320048612, now seen corresponding path program 1 times [2022-12-06 05:23:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:29,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887737646] [2022-12-06 05:23:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:29,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887737646] [2022-12-06 05:23:29,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887737646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:29,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:29,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579611968] [2022-12-06 05:23:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:29,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:29,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:29,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 05:23:29,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:29,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:29,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:29,828 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:29,829 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:29,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:29,842 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:29,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:29,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:29,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 05:23:29,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:29,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 05:23:29,877 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,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 05:23:29,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:29,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:29,877 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:29,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:29,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,902 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:29,902 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:29,903 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 05:23:29,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:29,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:30,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:30,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:23:30,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:30,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:30,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:30,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:30,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2022-12-06 05:23:30,064 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 05:23:30,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 422761723, now seen corresponding path program 1 times [2022-12-06 05:23:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:30,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061525989] [2022-12-06 05:23:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:30,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 05:23:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:30,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061525989] [2022-12-06 05:23:30,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061525989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:30,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:30,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186488359] [2022-12-06 05:23:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:30,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:30,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:30,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:30,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:30,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:30,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 05:23:30,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:30,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:30,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:30,404 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:30,404 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:30,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 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 05:23:30,418 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:30,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:30,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:30,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 05:23:30,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:30,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:30,450 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:30,450 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:30,450 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:30,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:30,450 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:30,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:30,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:30,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:30,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:30,475 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:30,475 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:23:30,477 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 05:23:30,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:30,478 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:30,619 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:30,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:23:30,619 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:30,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:30,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:30,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:30,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2022-12-06 05:23:30,619 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 05:23:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2129395238, now seen corresponding path program 1 times [2022-12-06 05:23:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:30,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427336952] [2022-12-06 05:23:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:30,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 05:23:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427336952] [2022-12-06 05:23:30,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427336952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:30,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:30,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709121830] [2022-12-06 05:23:30,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:30,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:30,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 05:23:30,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:30,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:30,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:30,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:30,956 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:30,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:30,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:30,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:30,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:30,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 05:23:30,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:31,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 05:23:31,003 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,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 05:23:31,004 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:31,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:31,004 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:31,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:31,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,029 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:31,029 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:31,030 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 05:23:31,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:31,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:31,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:31,179 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:31,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:31,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:31,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 05:23:31,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2022-12-06 05:23:31,180 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 05:23:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -386584903, now seen corresponding path program 1 times [2022-12-06 05:23:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115104382] [2022-12-06 05:23:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:31,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 05:23:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:31,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115104382] [2022-12-06 05:23:31,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115104382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:31,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:31,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:31,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50890266] [2022-12-06 05:23:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:31,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:31,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:31,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:31,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:31,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 05:23:31,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:31,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:31,505 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:31,505 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:23:31,512 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 05:23:31,519 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:31,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:31,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:31,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 05:23:31,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:31,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 05:23:31,552 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,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 05:23:31,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:31,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:31,552 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:31,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:31,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,577 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:31,577 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:23:31,578 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 05:23:31,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:31,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:31,724 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:31,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:31,725 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:31,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:31,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:31,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:31,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2022-12-06 05:23:31,725 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 05:23:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1356225432, now seen corresponding path program 1 times [2022-12-06 05:23:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:31,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594789436] [2022-12-06 05:23:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594789436] [2022-12-06 05:23:31,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594789436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:31,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:31,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:31,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860338773] [2022-12-06 05:23:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:31,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:31,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 05:23:31,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:31,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:31,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:32,078 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:32,078 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:32,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 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 05:23:32,091 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:32,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:32,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:32,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 05:23:32,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:32,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:32,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,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 05:23:32,123 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:32,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:32,123 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:32,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:32,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,147 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:32,148 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:32,149 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 05:23:32,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:32,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:32,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:23:32,294 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:32,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:32,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:32,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:32,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2022-12-06 05:23:32,294 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 05:23:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1195931529, now seen corresponding path program 1 times [2022-12-06 05:23:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:32,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945373620] [2022-12-06 05:23:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945373620] [2022-12-06 05:23:32,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945373620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:32,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:32,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005899074] [2022-12-06 05:23:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:32,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:32,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:32,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:32,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:32,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:32,649 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:32,649 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:32,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:32,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:32,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:32,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:32,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 05:23:32,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:32,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 05:23:32,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,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 05:23:32,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:32,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:32,699 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:32,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:32,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,724 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:32,724 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:32,725 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 05:23:32,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:32,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:32,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:32,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:23:32,869 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:32,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 05:23:32,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:32,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 05:23:32,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2022-12-06 05:23:32,869 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 05:23:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash 546878806, now seen corresponding path program 1 times [2022-12-06 05:23:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:32,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406238758] [2022-12-06 05:23:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:32,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 05:23:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:32,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406238758] [2022-12-06 05:23:32,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406238758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:32,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:32,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270128993] [2022-12-06 05:23:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:32,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:32,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:32,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:32,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 05:23:32,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:32,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:32,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:33,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:33,231 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:33,237 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 05:23:33,242 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:33,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:33,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:33,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 05:23:33,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:33,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 05:23:33,272 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,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 05:23:33,272 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:33,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:33,272 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:33,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:33,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,297 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:33,297 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:33,298 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 05:23:33,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:33,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:33,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:23:33,468 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:33,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:33,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:33,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:33,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2022-12-06 05:23:33,468 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 05:23:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2005278155, now seen corresponding path program 1 times [2022-12-06 05:23:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:33,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114066470] [2022-12-06 05:23:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:33,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 05:23:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:33,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114066470] [2022-12-06 05:23:33,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114066470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:33,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:33,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:33,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044499242] [2022-12-06 05:23:33,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:33,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:33,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:33,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:33,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:33,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 05:23:33,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:33,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:33,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:33,821 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:33,821 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:33,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:33,836 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:33,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:33,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23: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 05:23:33,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:33,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 05:23:33,869 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,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 05:23:33,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:33,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:33,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:33,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:33,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,895 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:33,895 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:23:33,896 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 05:23:33,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:33,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:34,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:34,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:23:34,036 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:34,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 05:23:34,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:34,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 05:23:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2022-12-06 05:23:34,036 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 05:23:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash -262467820, now seen corresponding path program 1 times [2022-12-06 05:23:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:34,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887855433] [2022-12-06 05:23:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:34,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 05:23:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:34,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887855433] [2022-12-06 05:23:34,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887855433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:34,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:34,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232632681] [2022-12-06 05:23:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:34,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:34,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:34,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:34,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:34,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 05:23:34,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:34,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:34,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:34,358 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:34,359 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:23:34,366 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 05:23:34,372 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:34,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:34,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:34,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 05:23:34,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:34,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:34,403 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:34,404 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:34,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:34,404 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:34,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:34,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,428 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:34,428 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:23:34,429 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 05:23:34,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:34,567 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:34,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 05:23:34,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:34,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 05:23:34,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:34,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 05:23:34,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2022-12-06 05:23:34,568 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 05:23:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1480342515, now seen corresponding path program 1 times [2022-12-06 05:23:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:34,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967441057] [2022-12-06 05:23:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:34,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:34,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967441057] [2022-12-06 05:23:34,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967441057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:34,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:34,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251153700] [2022-12-06 05:23:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:34,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:34,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:34,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 05:23:34,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:34,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:34,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:34,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:34,912 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:34,918 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 05:23:34,924 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:34,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:34,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:34,925 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:34,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 05:23:34,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,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 05:23:34,956 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:34,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:34,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:34,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:34,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,980 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:34,980 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:34,981 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 05:23:34,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:34,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:35,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:35,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:23:35,120 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:35,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:35,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:35,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 05:23:35,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2022-12-06 05:23:35,121 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 05:23:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1071814446, now seen corresponding path program 1 times [2022-12-06 05:23:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:35,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310398099] [2022-12-06 05:23:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:35,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 05:23:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310398099] [2022-12-06 05:23:35,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310398099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:35,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:35,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755308479] [2022-12-06 05:23:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:35,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:35,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:35,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:35,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:35,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:35,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:35,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:35,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:35,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:35,439 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:35,440 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:35,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:23:35,454 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:35,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:35,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:35,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 05:23:35,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:35,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 05:23:35,487 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:35,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 05:23:35,487 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:35,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:35,487 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:35,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:35,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:35,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:35,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:35,512 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:35,512 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:23:35,513 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 05:23:35,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:35,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:35,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:35,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:23:35,668 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:35,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 05:23:35,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:35,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:35,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2022-12-06 05:23:35,669 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 05:23:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash 670995889, now seen corresponding path program 1 times [2022-12-06 05:23:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:35,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681408597] [2022-12-06 05:23:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681408597] [2022-12-06 05:23:35,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681408597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:35,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:35,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801444117] [2022-12-06 05:23:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:35,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:35,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 05:23:35,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:35,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:35,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:36,027 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:36,028 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:36,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:23:36,042 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:36,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:36,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:36,043 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:36,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:36,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:36,079 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:36,079 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:36,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:36,079 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:36,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:36,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,104 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:36,104 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:36,105 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 05:23:36,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:36,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:36,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:23:36,250 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:36,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 05:23:36,250 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:36,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 05:23:36,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2022-12-06 05:23:36,250 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 05:23:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1881161072, now seen corresponding path program 1 times [2022-12-06 05:23:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988789630] [2022-12-06 05:23:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:36,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988789630] [2022-12-06 05:23:36,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988789630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:36,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:36,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166446938] [2022-12-06 05:23:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:36,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:36,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:36,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:36,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:36,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:36,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:36,594 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:36,595 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:36,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 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 05:23:36,608 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:36,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:36,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:36,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 05:23:36,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:36,639 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:36,639 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:36,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:36,640 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:36,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:36,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,665 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:36,665 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:23:36,666 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 05:23:36,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:36,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:36,820 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:36,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:23:36,820 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:36,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 05:23:36,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:36,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 05:23:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2022-12-06 05:23:36,820 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 05:23:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -138350737, now seen corresponding path program 1 times [2022-12-06 05:23:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:36,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619780124] [2022-12-06 05:23:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:36,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 05:23:36,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:36,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619780124] [2022-12-06 05:23:36,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619780124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:36,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:36,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957567489] [2022-12-06 05:23:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:36,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:36,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:36,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:36,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:36,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 05:23:36,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:36,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:36,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:37,176 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:37,176 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:37,183 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 05:23:37,191 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:37,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:37,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:37,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:37,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 05:23:37,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:37,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:37,226 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,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 05:23:37,226 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:37,226 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:37,226 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:37,227 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:37,227 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,251 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:37,252 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:37,253 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 05:23:37,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:37,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:37,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:23:37,410 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:37,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 05:23:37,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:37,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 05:23:37,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2022-12-06 05:23:37,410 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 05:23:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1604459598, now seen corresponding path program 1 times [2022-12-06 05:23:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:37,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046133857] [2022-12-06 05:23:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:37,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 05:23:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:37,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046133857] [2022-12-06 05:23:37,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046133857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:37,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:37,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584607144] [2022-12-06 05:23:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:37,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:37,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 05:23:37,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:37,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:37,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:37,773 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:37,774 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23: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 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 05:23:37,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:37,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:37,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:37,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 05:23:37,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:37,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:37,816 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:37,816 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:37,816 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:37,816 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:37,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:37,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,841 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:37,842 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:37,843 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 05:23:37,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:37,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:37,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:37,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:37,999 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:38,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:38,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:38,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:38,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2022-12-06 05:23:38,000 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 05:23:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash -947697363, now seen corresponding path program 1 times [2022-12-06 05:23:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:38,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993554260] [2022-12-06 05:23:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:38,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993554260] [2022-12-06 05:23:38,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993554260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:38,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:38,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545211302] [2022-12-06 05:23:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:38,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:38,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:38,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:38,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:38,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:38,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:38,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:38,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:38,328 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:38,328 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:23:38,335 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 05:23:38,342 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:38,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:38,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:38,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 05:23:38,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:38,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 05:23:38,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:38,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 05:23:38,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:38,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:38,396 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:38,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:38,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:38,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:38,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:38,431 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:38,432 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:38,433 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 05:23:38,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:38,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:38,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:38,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:23:38,591 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:38,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:38,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2022-12-06 05:23:38,591 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 05:23:38,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 795112972, now seen corresponding path program 1 times [2022-12-06 05:23:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:38,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429183248] [2022-12-06 05:23:38,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:38,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:38,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 05:23:38,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429183248] [2022-12-06 05:23:38,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429183248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:38,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:38,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373251805] [2022-12-06 05:23:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:38,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:38,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 05:23:38,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:38,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:38,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:38,944 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:38,945 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:23:38,952 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 05:23:38,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:38,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:38,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:38,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 05:23:38,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:39,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:39,002 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:39,002 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:39,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:39,003 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:39,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:39,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,028 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:39,028 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:23:39,029 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 05:23:39,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:39,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:39,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:39,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:39,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:39,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:39,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 05:23:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2022-12-06 05:23:39,176 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 05:23:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1757043989, now seen corresponding path program 1 times [2022-12-06 05:23:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:39,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914081876] [2022-12-06 05:23:39,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23: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 05:23:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:39,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914081876] [2022-12-06 05:23:39,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914081876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:39,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:39,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470857333] [2022-12-06 05:23:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:39,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:39,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:39,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:39,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 05:23:39,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:39,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:39,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:39,548 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:39,548 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:39,554 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 05:23:39,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:39,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:39,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:39,562 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:39,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:39,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:39,593 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:39,593 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:39,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:39,593 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:39,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:39,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,618 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:39,618 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:39,619 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 05:23:39,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:39,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:39,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:39,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:39,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:39,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 05:23:39,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:39,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 05:23:39,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2022-12-06 05:23:39,776 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 05:23:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -14233654, now seen corresponding path program 1 times [2022-12-06 05:23:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:39,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019459012] [2022-12-06 05:23:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:39,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019459012] [2022-12-06 05:23:39,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019459012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:39,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:39,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:39,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91042066] [2022-12-06 05:23:39,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:39,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:39,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:39,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:39,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:39,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:39,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:40,131 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:40,131 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:40,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 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 05:23:40,146 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:40,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:40,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:40,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 05:23:40,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:40,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:40,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:40,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:40,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:40,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:40,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:40,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,206 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:40,206 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:23:40,207 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 05:23:40,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:40,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:40,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:40,354 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:40,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 05:23:40,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:40,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 05:23:40,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2022-12-06 05:23:40,354 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 05:23:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1728576681, now seen corresponding path program 1 times [2022-12-06 05:23:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:40,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484843858] [2022-12-06 05:23:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:40,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 05:23:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484843858] [2022-12-06 05:23:40,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484843858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:40,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:40,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581473577] [2022-12-06 05:23:40,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:40,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:40,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:40,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:40,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:40,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:40,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:40,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:40,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:40,691 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:23:40,698 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 05:23:40,706 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:40,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:40,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:40,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 05:23:40,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:40,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 05:23:40,740 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,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 05:23:40,740 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:40,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:40,740 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:40,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:40,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,765 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:40,765 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:23:40,766 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 05:23:40,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:40,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:40,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:40,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:23:40,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:40,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 05:23:40,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:40,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 05:23:40,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2022-12-06 05:23:40,928 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 05:23:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -823580280, now seen corresponding path program 1 times [2022-12-06 05:23:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:40,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731753460] [2022-12-06 05:23:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:40,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 05:23:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:40,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731753460] [2022-12-06 05:23:40,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731753460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:40,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:40,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857724696] [2022-12-06 05:23:40,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:40,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:40,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:40,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:40,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 05:23:40,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:40,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:40,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:41,266 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:41,266 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:41,274 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 05:23:41,282 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:41,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:41,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:41,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 05:23:41,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:41,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 05:23:41,317 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,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 05:23:41,317 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:41,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:41,317 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:41,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:41,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,342 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:41,343 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:41,344 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 05:23:41,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:41,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:41,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:41,492 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:41,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 05:23:41,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:41,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 05:23:41,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2022-12-06 05:23:41,492 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 05:23:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash 919230055, now seen corresponding path program 1 times [2022-12-06 05:23:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:41,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218569412] [2022-12-06 05:23:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:41,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 05:23:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:41,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218569412] [2022-12-06 05:23:41,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218569412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:41,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:41,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849458675] [2022-12-06 05:23:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:41,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:41,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:41,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 05:23:41,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:41,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:41,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:41,830 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:41,830 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:41,837 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 05:23:41,845 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:41,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:41,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:41,846 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:41,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:41,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:41,879 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,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 05:23:41,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:41,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:41,879 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:41,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:41,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,904 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:41,904 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:41,905 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 05:23:41,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:41,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:42,053 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:42,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:42,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:42,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 05:23:42,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:42,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 05:23:42,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2022-12-06 05:23:42,054 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 05:23:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1632926906, now seen corresponding path program 1 times [2022-12-06 05:23:42,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:42,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656604522] [2022-12-06 05:23:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:42,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 05:23:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:42,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656604522] [2022-12-06 05:23:42,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656604522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:42,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:42,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440923370] [2022-12-06 05:23:42,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:42,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:42,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 05:23:42,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:42,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:42,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:42,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:42,424 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:42,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 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 05:23:42,436 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:42,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:42,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:42,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 05:23:42,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:42,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 05:23:42,465 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:42,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 05:23:42,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:42,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:42,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:42,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:42,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:42,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:42,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:42,490 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:42,490 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:42,491 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 05:23:42,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:42,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:42,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:42,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:23:42,652 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:42,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 05:23:42,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:42,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 05:23:42,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2022-12-06 05:23:42,652 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 05:23:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash 109883429, now seen corresponding path program 1 times [2022-12-06 05:23:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:42,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140540992] [2022-12-06 05:23:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:42,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 05:23:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140540992] [2022-12-06 05:23:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140540992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137716852] [2022-12-06 05:23:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:42,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:42,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:42,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 05:23:42,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:42,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:42,998 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:42,999 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:43,005 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 05:23:43,013 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:43,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:43,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:43,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 05:23:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:43,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 05:23:43,046 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,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 05:23:43,047 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:43,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:43,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:43,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:43,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,074 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:43,075 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:43,076 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 05:23:43,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:43,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:43,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:23:43,234 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:43,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 05:23:43,234 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:43,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 05:23:43,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2022-12-06 05:23:43,234 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 05:23:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1852693764, now seen corresponding path program 1 times [2022-12-06 05:23:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:43,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148369304] [2022-12-06 05:23:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148369304] [2022-12-06 05:23:43,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148369304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:43,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:43,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711287840] [2022-12-06 05:23:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:43,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:43,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:43,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:43,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 05:23:43,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:43,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:43,562 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:43,562 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:43,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:43,576 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:43,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:43,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:43,577 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:43,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:43,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 05:23:43,608 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,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 05:23:43,608 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:43,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:43,608 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:43,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:43,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,633 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:43,633 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:23:43,634 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 05:23:43,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:43,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:43,781 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:43,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:43,781 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:43,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 05:23:43,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:43,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 05:23:43,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2022-12-06 05:23:43,782 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 05:23:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -699463197, now seen corresponding path program 1 times [2022-12-06 05:23:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:43,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062319680] [2022-12-06 05:23:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:43,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:43,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 05:23:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:43,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062319680] [2022-12-06 05:23:43,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062319680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:43,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:43,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173531149] [2022-12-06 05:23:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:43,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:43,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:43,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:43,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 05:23:43,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:43,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:43,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:44,140 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:44,140 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:23:44,147 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 05:23:44,154 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:44,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:44,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:44,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 05:23:44,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:44,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 05:23:44,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,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 05:23:44,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:44,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:44,183 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:44,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:44,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,208 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:44,208 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:23:44,209 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 05:23:44,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:44,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:44,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:23:44,352 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:44,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 05:23:44,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:44,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 05:23:44,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2022-12-06 05:23:44,352 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 05:23:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1043347138, now seen corresponding path program 1 times [2022-12-06 05:23:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334758564] [2022-12-06 05:23:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:44,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 05:23:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:44,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334758564] [2022-12-06 05:23:44,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334758564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:44,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:44,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309971] [2022-12-06 05:23:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:44,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:44,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 05:23:44,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:44,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:44,698 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:44,699 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:44,705 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 05:23:44,712 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:44,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:44,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:44,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 05:23:44,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:44,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 05:23:44,745 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,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 05:23:44,745 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:44,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:44,745 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:44,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:44,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,770 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:44,770 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:44,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 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 05:23:44,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:44,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:44,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:44,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:23:44,928 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:44,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 05:23:44,928 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:44,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 05:23:44,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2022-12-06 05:23:44,928 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 05:23:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1508809823, now seen corresponding path program 1 times [2022-12-06 05:23:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287768012] [2022-12-06 05:23:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:44,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 05:23:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:44,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287768012] [2022-12-06 05:23:44,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287768012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:44,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:44,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731931116] [2022-12-06 05:23:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:44,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:44,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:44,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 05:23:44,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:44,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:44,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:45,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:45,268 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:45,274 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 05:23:45,282 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:45,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:45,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23: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 05:23:45,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:45,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:45,316 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:45,317 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:45,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:45,317 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:45,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:45,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,341 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:45,342 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:45,343 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 05:23:45,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:45,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:45,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:23:45,499 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:45,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 05:23:45,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:45,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 05:23:45,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2022-12-06 05:23:45,499 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 05:23:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash 234000512, now seen corresponding path program 1 times [2022-12-06 05:23:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:45,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080520092] [2022-12-06 05:23:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:45,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 05:23:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:45,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080520092] [2022-12-06 05:23:45,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080520092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:45,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:45,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:45,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013747199] [2022-12-06 05:23:45,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:45,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:45,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:45,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 05:23:45,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:45,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:45,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:45,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:45,826 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:45,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:23:45,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:45,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:45,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:45,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 05:23:45,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:45,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 05:23:45,874 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,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 05:23:45,875 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:45,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:45,875 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:45,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:45,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,899 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:45,899 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:23:45,900 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 05:23:45,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:45,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:46,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:46,044 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:23:46,044 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:46,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 05:23:46,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:46,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 05:23:46,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2022-12-06 05:23:46,045 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 05:23:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1976810847, now seen corresponding path program 1 times [2022-12-06 05:23:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:46,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004026087] [2022-12-06 05:23:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:46,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:46,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 05:23:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004026087] [2022-12-06 05:23:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004026087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:46,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:46,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008603116] [2022-12-06 05:23:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:46,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:46,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:46,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:46,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:46,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 05:23:46,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:46,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:46,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:46,383 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:46,383 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:46,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:46,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:46,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:46,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23: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 05:23:46,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:46,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 05:23:46,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,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 05:23:46,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:46,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:46,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:46,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:46,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,455 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:46,455 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:23:46,456 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 05:23:46,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:46,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:46,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:23:46,608 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:46,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:46,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 05:23:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2022-12-06 05:23:46,609 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 05:23:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -575346114, now seen corresponding path program 1 times [2022-12-06 05:23:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210530980] [2022-12-06 05:23:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:46,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 05:23:46,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:46,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210530980] [2022-12-06 05:23:46,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210530980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:46,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:46,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:46,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140009377] [2022-12-06 05:23:46,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:46,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:46,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:46,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:46,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:46,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 05:23:46,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:46,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:46,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:46,950 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:46,950 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:46,956 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 05:23:46,962 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:46,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:46,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:46,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 05:23:46,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:46,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 05:23:46,990 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,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 05:23:46,991 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:46,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:46,991 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:46,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:46,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:47,015 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:47,015 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:47,016 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 05:23:47,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:47,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:47,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:47,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:23:47,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:47,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 05:23:47,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:47,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 05:23:47,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2022-12-06 05:23:47,162 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 05:23:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1167464221, now seen corresponding path program 1 times [2022-12-06 05:23:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:47,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31095002] [2022-12-06 05:23:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:47,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 05:23:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:47,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31095002] [2022-12-06 05:23:47,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31095002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:47,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:47,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:47,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743409473] [2022-12-06 05:23:47,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:47,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:47,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:47,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:47,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:47,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 05:23:47,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:47,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:47,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:47,512 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:47,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:47,527 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:47,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:47,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:47,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 05:23:47,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:47,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:47,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23: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 05:23:47,559 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:47,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:47,559 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:47,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:47,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:47,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:47,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:47,584 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:47,584 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:47,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 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 05:23:47,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:47,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:47,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:47,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:23:47,741 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:47,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 05:23:47,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:47,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 05:23:47,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2022-12-06 05:23:47,742 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 05:23:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1384692740, now seen corresponding path program 1 times [2022-12-06 05:23:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:47,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682272256] [2022-12-06 05:23:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:47,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 05:23:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682272256] [2022-12-06 05:23:47,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682272256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:47,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:47,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008328268] [2022-12-06 05:23:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:47,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:47,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:47,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 05:23:47,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:47,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:47,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:48,061 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:48,061 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:48,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:48,074 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:48,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:48,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:48,074 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:48,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:48,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 05:23:48,107 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,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 05:23:48,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:48,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:48,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:48,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:48,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,132 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:48,132 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:23:48,133 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 05:23:48,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:48,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:48,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:23:48,293 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:48,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 05:23:48,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:48,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 05:23:48,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2022-12-06 05:23:48,293 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 05:23:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash 358117595, now seen corresponding path program 1 times [2022-12-06 05:23:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:48,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364640958] [2022-12-06 05:23:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:48,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 05:23:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364640958] [2022-12-06 05:23:48,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364640958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:48,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:48,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299380035] [2022-12-06 05:23:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:48,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:48,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:48,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:48,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:48,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 05:23:48,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:48,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:48,631 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:48,632 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:48,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 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 05:23:48,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:48,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:48,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:48,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 05:23:48,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:48,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 05:23:48,679 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,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 05:23:48,680 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:48,680 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:48,680 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:48,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:48,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,705 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:48,705 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:23:48,706 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 05:23:48,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:48,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:48,845 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:48,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:23:48,845 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:48,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:48,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:48,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:48,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2022-12-06 05:23:48,845 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 05:23:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2100927930, now seen corresponding path program 1 times [2022-12-06 05:23:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:48,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181851520] [2022-12-06 05:23:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181851520] [2022-12-06 05:23:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181851520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:48,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:48,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:48,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014533730] [2022-12-06 05:23:48,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:48,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:48,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:48,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 05:23:48,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:48,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:48,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:49,190 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:49,191 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:49,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 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 05:23:49,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:49,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:49,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:49,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 05:23:49,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:49,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 05:23:49,239 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,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 05:23:49,239 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:49,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:49,240 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:49,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:49,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,265 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:49,265 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:49,266 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 05:23:49,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:49,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:49,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:23:49,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:49,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 05:23:49,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:49,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 05:23:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2022-12-06 05:23:49,414 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 05:23:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -451229031, now seen corresponding path program 1 times [2022-12-06 05:23:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:49,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590478747] [2022-12-06 05:23:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23: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 05:23:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:49,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590478747] [2022-12-06 05:23:49,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590478747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:49,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:49,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416659325] [2022-12-06 05:23:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:49,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:49,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:49,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:49,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:49,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 05:23:49,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:49,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:49,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:49,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:49,752 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:49,759 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 05:23:49,768 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:49,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:49,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:49,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 05:23:49,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:49,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 05:23:49,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,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 05:23:49,805 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:49,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:49,805 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:49,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:49,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,840 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:49,841 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:23:49,842 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 05:23:49,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:49,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:49,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:49,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:23:49,983 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:49,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 05:23:49,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:49,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 05:23:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2022-12-06 05:23:49,984 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 05:23:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:49,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1291581304, now seen corresponding path program 1 times [2022-12-06 05:23:49,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:49,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452178476] [2022-12-06 05:23:49,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:49,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:50,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 05:23:50,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:50,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452178476] [2022-12-06 05:23:50,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452178476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:50,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:50,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:50,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437668296] [2022-12-06 05:23:50,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:50,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:50,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:50,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:50,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:50,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:50,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:50,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:50,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:50,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:50,319 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:50,325 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 05:23:50,333 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:50,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:50,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:50,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 05:23:50,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:50,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:50,369 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,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 05:23:50,369 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:50,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:50,369 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:50,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:50,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,394 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:50,394 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:23:50,395 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 05:23:50,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:50,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:50,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:50,546 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:50,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:50,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:50,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2022-12-06 05:23:50,547 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 05:23:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1260575657, now seen corresponding path program 1 times [2022-12-06 05:23:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851522688] [2022-12-06 05:23:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:50,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 05:23:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:50,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851522688] [2022-12-06 05:23:50,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851522688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:50,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:50,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286179965] [2022-12-06 05:23:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:50,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:50,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:50,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 05:23:50,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:50,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:50,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:50,899 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:50,900 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:50,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 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 05:23:50,914 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:50,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:50,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:50,914 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:50,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:50,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:50,950 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,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 05:23:50,950 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:50,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:50,951 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:50,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:50,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:50,984 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:50,985 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 05:23:50,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:50,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:51,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:51,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:23:51,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:51,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 05:23:51,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:51,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 05:23:51,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2022-12-06 05:23:51,130 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 05:23:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash 482234678, now seen corresponding path program 1 times [2022-12-06 05:23:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:51,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055835844] [2022-12-06 05:23:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:51,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:51,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 05:23:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:51,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055835844] [2022-12-06 05:23:51,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055835844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:51,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:51,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152550169] [2022-12-06 05:23:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:51,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:51,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:51,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 05:23:51,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:51,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:51,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:51,522 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:51,522 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:51,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 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 05:23:51,535 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:51,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:51,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:51,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 05:23:51,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:51,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:51,566 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:51,566 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:51,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:51,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:51,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:51,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:51,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:51,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:51,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:51,592 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:51,592 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:51,593 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 05:23:51,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:51,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:51,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:51,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:23:51,745 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:51,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:51,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:51,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:51,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2022-12-06 05:23:51,745 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 05:23:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2069922283, now seen corresponding path program 1 times [2022-12-06 05:23:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455641593] [2022-12-06 05:23:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:51,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 05:23:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455641593] [2022-12-06 05:23:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455641593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:51,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641243705] [2022-12-06 05:23:51,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:51,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:51,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:51,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:51,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:51,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 05:23:51,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:51,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:51,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:52,099 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:52,099 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:52,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:52,114 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:52,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:52,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:52,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 05:23:52,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:52,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 05:23:52,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,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 05:23:52,148 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:52,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:52,149 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:52,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:52,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,174 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:52,174 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:52,175 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 05:23:52,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,177 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:52,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:52,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:23:52,337 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:52,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 05:23:52,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:52,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 05:23:52,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2022-12-06 05:23:52,337 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 05:23:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -327111948, now seen corresponding path program 1 times [2022-12-06 05:23:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985708146] [2022-12-06 05:23:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:52,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 05:23:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:52,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985708146] [2022-12-06 05:23:52,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985708146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:52,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:52,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561657911] [2022-12-06 05:23:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:52,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:52,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:52,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 05:23:52,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:52,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:52,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:52,671 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:52,671 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:52,678 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 05:23:52,686 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:52,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:52,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:52,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 05:23:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:52,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 05:23:52,720 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:52,720 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:52,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:52,720 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:52,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:52,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,745 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:52,745 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:23:52,746 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 05:23:52,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:52,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:52,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:52,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:52,895 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:52,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 05:23:52,896 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:52,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 05:23:52,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2022-12-06 05:23:52,896 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 05:23:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1415698387, now seen corresponding path program 1 times [2022-12-06 05:23:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:52,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236566491] [2022-12-06 05:23:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236566491] [2022-12-06 05:23:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236566491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356697539] [2022-12-06 05:23:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:52,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:52,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:52,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 05:23:52,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:52,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:52,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:53,262 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:53,262 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:23:53,270 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 05:23:53,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:53,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:53,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:53,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 05:23:53,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:53,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 05:23:53,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,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 05:23:53,314 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:53,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:53,314 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:53,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:53,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,339 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:53,339 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:53,341 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 05:23:53,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:53,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:53,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:53,491 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:53,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:53,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:53,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:53,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2022-12-06 05:23:53,491 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 05:23:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1136458574, now seen corresponding path program 1 times [2022-12-06 05:23:53,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:53,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305337873] [2022-12-06 05:23:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:53,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:53,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 05:23:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305337873] [2022-12-06 05:23:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305337873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:53,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:53,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922402279] [2022-12-06 05:23:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:53,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:53,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:53,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:53,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:53,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 05:23:53,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:53,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:53,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:53,835 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:53,835 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:53,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 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 05:23:53,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:53,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:53,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:53,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 05:23:53,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:53,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 05:23:53,887 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,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 05:23:53,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:53,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:53,887 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:53,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:53,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:53,921 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:23:53,923 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 05:23:53,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:53,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:54,074 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:54,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:23:54,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:54,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 05:23:54,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:54,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 05:23:54,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2022-12-06 05:23:54,075 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 05:23:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash 606351761, now seen corresponding path program 1 times [2022-12-06 05:23:54,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:54,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510360436] [2022-12-06 05:23:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:54,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 05:23:54,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:54,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510360436] [2022-12-06 05:23:54,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510360436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:54,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:54,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:54,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494175214] [2022-12-06 05:23:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:54,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:54,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:54,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:54,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:54,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:54,407 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:54,407 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:23:54,414 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 05:23:54,423 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:54,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:54,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:54,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 05:23:54,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:54,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 05:23:54,458 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:54,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 05:23:54,458 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:54,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:54,458 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:54,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:54,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:54,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:54,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:54,491 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:54,491 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:54,492 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 05:23:54,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:54,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:54,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:54,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:23:54,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:54,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 05:23:54,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:54,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 05:23:54,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2022-12-06 05:23:54,643 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 05:23:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1945805200, now seen corresponding path program 1 times [2022-12-06 05:23:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:54,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525574124] [2022-12-06 05:23:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525574124] [2022-12-06 05:23:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525574124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472524752] [2022-12-06 05:23:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:54,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:54,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 05:23:54,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:54,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:54,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:54,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:54,972 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:54,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 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 05:23:54,986 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:54,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:54,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:54,987 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:54,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:55,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:55,022 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:55,022 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:55,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:55,022 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:55,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:55,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,050 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:55,050 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:23:55,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 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 05:23:55,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:55,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:55,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:23:55,200 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:55,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 05:23:55,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:55,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 05:23:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2022-12-06 05:23:55,201 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 05:23:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash -202994865, now seen corresponding path program 1 times [2022-12-06 05:23:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400933156] [2022-12-06 05:23:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:55,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 05:23:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:55,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400933156] [2022-12-06 05:23:55,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400933156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:55,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:55,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992066578] [2022-12-06 05:23:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:55,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:55,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:55,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 05:23:55,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:55,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:55,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:55,547 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:55,547 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:23:55,554 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 05:23:55,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:55,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:55,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:55,562 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:55,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:55,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:55,596 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:55,596 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:55,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:55,597 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:55,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:55,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,622 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:55,622 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:23:55,623 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 05:23:55,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:55,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:55,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:55,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:23:55,770 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:55,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:55,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:55,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2022-12-06 05:23:55,770 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 05:23:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1539815470, now seen corresponding path program 1 times [2022-12-06 05:23:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:55,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343454902] [2022-12-06 05:23:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:55,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343454902] [2022-12-06 05:23:55,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343454902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:55,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340646359] [2022-12-06 05:23:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:55,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:55,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:55,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 05:23:55,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:55,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:55,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:56,130 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:56,130 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:56,136 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 05:23:56,143 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:56,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:56,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:56,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 05:23:56,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:56,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 05:23:56,174 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,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 05:23:56,174 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:56,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:56,174 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:56,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:56,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,198 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:56,198 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:23:56,199 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 05:23:56,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:56,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:56,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:23:56,344 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:56,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 05:23:56,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:56,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 05:23:56,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2022-12-06 05:23:56,345 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 05:23:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1012341491, now seen corresponding path program 1 times [2022-12-06 05:23:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:56,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753696375] [2022-12-06 05:23:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:56,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753696375] [2022-12-06 05:23:56,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753696375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:56,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:56,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770615475] [2022-12-06 05:23:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:56,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:56,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:56,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:56,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:56,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 05:23:56,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:56,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:56,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:56,688 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:56,688 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:56,695 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 05:23:56,702 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:56,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:56,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:56,703 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:56,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:56,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 05:23:56,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,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 05:23:56,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:56,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:56,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:56,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:56,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,761 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:56,761 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:23:56,762 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 05:23:56,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:56,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:56,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:56,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:56,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:56,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 05:23:56,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:56,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 05:23:56,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2022-12-06 05:23:56,913 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 05:23:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 730468844, now seen corresponding path program 1 times [2022-12-06 05:23:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:56,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793982410] [2022-12-06 05:23:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:56,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 05:23:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793982410] [2022-12-06 05:23:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793982410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:56,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394191439] [2022-12-06 05:23:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:56,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:56,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:56,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 05:23:56,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:56,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:56,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:57,264 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:57,264 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:57,271 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 05:23:57,279 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:57,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:57,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:57,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:23:57,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:57,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 05:23:57,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,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 05:23:57,315 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:57,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:57,315 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:57,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:57,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,340 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:57,340 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 05:23:57,341 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 05:23:57,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:57,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:57,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:23:57,492 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:57,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 05:23:57,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:57,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 05:23:57,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2022-12-06 05:23:57,492 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 05:23:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1821688117, now seen corresponding path program 1 times [2022-12-06 05:23:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811995925] [2022-12-06 05:23:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:57,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 05:23:57,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:57,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811995925] [2022-12-06 05:23:57,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811995925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:57,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:57,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229436170] [2022-12-06 05:23:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:57,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:57,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:57,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:57,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:57,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 05:23:57,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:57,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:57,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:57,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:57,840 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:23:57,847 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 05:23:57,854 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:57,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:57,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:57,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 05:23:57,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:57,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 05:23:57,889 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,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 05:23:57,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:57,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:57,889 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:57,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:57,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,914 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:57,914 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:57,915 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 05:23:57,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:57,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:58,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:58,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:23:58,064 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:58,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:58,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:58,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:58,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2022-12-06 05:23:58,064 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 05:23:58,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash -78877782, now seen corresponding path program 1 times [2022-12-06 05:23:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:58,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580800431] [2022-12-06 05:23:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:58,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:58,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 05:23:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580800431] [2022-12-06 05:23:58,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580800431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:58,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:58,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628628666] [2022-12-06 05:23:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:58,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:58,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 05:23:58,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:58,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:58,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:58,403 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:58,403 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:58,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 05:23:58,417 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:58,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:58,417 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:58,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 05:23:58,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:58,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:58,449 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:58,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:23:58,449 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:58,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:58,449 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:58,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:58,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:58,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:58,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:58,474 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:58,474 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:23:58,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 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 05:23:58,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:58,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:58,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:58,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:23:58,625 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:58,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:58,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:58,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:58,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2022-12-06 05:23:58,626 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 05:23:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1663932553, now seen corresponding path program 1 times [2022-12-06 05:23:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:58,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655400774] [2022-12-06 05:23:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:58,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655400774] [2022-12-06 05:23:58,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655400774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:58,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:58,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447189231] [2022-12-06 05:23:58,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:58,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:58,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:58,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:58,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:58,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:58,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:58,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:58,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:58,997 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:58,997 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:23:59,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 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 05:23:59,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:59,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:59,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:59,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 05:23:59,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:59,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 05:23:59,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,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 05:23:59,069 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:59,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:59,070 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:59,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:59,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,094 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:23:59,094 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:23:59,096 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 05:23:59,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:59,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:59,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:23:59,248 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:59,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:59,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:59,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2022-12-06 05:23:59,248 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 05:23:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -888224408, now seen corresponding path program 1 times [2022-12-06 05:23:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:59,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340538659] [2022-12-06 05:23:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:59,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 05:23:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:59,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340538659] [2022-12-06 05:23:59,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340538659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:59,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:59,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306489353] [2022-12-06 05:23:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:59,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:59,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:59,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 05:23:59,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:59,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:59,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:59,576 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:23:59,576 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:23:59,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:23:59,591 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:23:59,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:23:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:23:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:23:59,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:23:59,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 05:23:59,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:23:59,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 05:23:59,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,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 05:23:59,622 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:23:59,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:59,622 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:59,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:59,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,647 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:23:59,647 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:23:59,648 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 05:23:59,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:23:59,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:23:59,805 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:59,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:23:59,806 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:23:59,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 05:23:59,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:59,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 05:23:59,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2022-12-06 05:23:59,806 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 05:23:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:59,806 INFO L85 PathProgramCache]: Analyzing trace with hash 854585927, now seen corresponding path program 1 times [2022-12-06 05:23:59,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:59,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209107815] [2022-12-06 05:23:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209107815] [2022-12-06 05:23:59,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209107815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:59,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:59,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678062760] [2022-12-06 05:23:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:59,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:23:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:59,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:23:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:23:59,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:23:59,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 05:23:59,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:59,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:23:59,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:00,136 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:00,136 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:00,143 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 05:24:00,150 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:00,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:00,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:00,151 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:00,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:00,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 05:24:00,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,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 05:24:00,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:00,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:00,184 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:00,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:00,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,208 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:00,208 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:00,209 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 05:24:00,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:00,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:00,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:24:00,371 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:00,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 05:24:00,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:00,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:00,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2022-12-06 05:24:00,371 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 05:24:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1697571034, now seen corresponding path program 1 times [2022-12-06 05:24:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:00,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522171620] [2022-12-06 05:24:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:00,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:00,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522171620] [2022-12-06 05:24:00,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522171620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:00,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:00,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995861080] [2022-12-06 05:24:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:00,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:00,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:00,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:00,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:00,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:00,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:00,707 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:00,707 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:24:00,713 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 05:24:00,719 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:00,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:00,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:00,720 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:00,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:00,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:00,749 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:00,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:00,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:00,750 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:00,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:00,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,774 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:00,774 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:00,775 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 05:24:00,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:00,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:00,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:00,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:24:00,924 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:00,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 05:24:00,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:00,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 05:24:00,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2022-12-06 05:24:00,925 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 05:24:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 45239301, now seen corresponding path program 1 times [2022-12-06 05:24:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:00,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322072826] [2022-12-06 05:24:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:00,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322072826] [2022-12-06 05:24:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322072826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:00,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:00,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10147157] [2022-12-06 05:24:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:00,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:00,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 05:24:00,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:00,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:01,248 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:01,248 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:01,255 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 05:24:01,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:01,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:01,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:01,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 05:24:01,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:01,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 05:24:01,294 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,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 05:24:01,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:01,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:01,295 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:01,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:01,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,319 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:01,319 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:01,320 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 05:24:01,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:01,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:01,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:01,473 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:01,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 05:24:01,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:01,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 05:24:01,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2022-12-06 05:24:01,474 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 05:24:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1788049636, now seen corresponding path program 1 times [2022-12-06 05:24:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:01,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336031362] [2022-12-06 05:24:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:01,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 05:24:01,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:01,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336031362] [2022-12-06 05:24:01,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336031362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:01,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:01,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696494795] [2022-12-06 05:24:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:01,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:01,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:01,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:01,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:01,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:01,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 05:24:01,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:01,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:01,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:01,814 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:01,815 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:01,821 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 05:24:01,828 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:01,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:01,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:01,829 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:01,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:01,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:01,861 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:01,861 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:01,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:01,861 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:01,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:01,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,886 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:01,886 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:24:01,887 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 05:24:01,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:01,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:02,029 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:02,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:24:02,029 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:02,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:02,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:02,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 05:24:02,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2022-12-06 05:24:02,029 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 05:24:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -764107325, now seen corresponding path program 1 times [2022-12-06 05:24:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:02,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451361915] [2022-12-06 05:24:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:02,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 05:24:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451361915] [2022-12-06 05:24:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451361915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:02,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:02,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443896310] [2022-12-06 05:24:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:02,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:02,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:02,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 05:24:02,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:02,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:02,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:02,357 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:02,357 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:02,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:02,372 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:02,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:02,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:02,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 05:24:02,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:02,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:02,403 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:02,404 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:02,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:02,404 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:02,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:02,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,428 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:02,428 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:24:02,429 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 05:24:02,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:02,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:02,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:02,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:02,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 05:24:02,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:02,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 05:24:02,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2022-12-06 05:24:02,587 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 05:24:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 978703010, now seen corresponding path program 1 times [2022-12-06 05:24:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:02,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864546253] [2022-12-06 05:24:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:02,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864546253] [2022-12-06 05:24:02,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864546253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:02,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:02,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178213170] [2022-12-06 05:24:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:02,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:02,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:02,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:02,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:02,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:02,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:02,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:02,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:02,916 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:02,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:02,929 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:02,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:02,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:02,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 05:24:02,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:02,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 05:24:02,962 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,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 05:24:02,962 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:02,962 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:02,962 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:02,962 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:02,962 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,986 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:02,987 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:24:02,987 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 05:24:02,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:02,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:03,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:03,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:03,141 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:03,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 05:24:03,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:03,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 05:24:03,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2022-12-06 05:24:03,141 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 05:24:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1573453951, now seen corresponding path program 1 times [2022-12-06 05:24:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:03,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924799487] [2022-12-06 05:24:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:03,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 05:24:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:03,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924799487] [2022-12-06 05:24:03,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924799487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:03,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:03,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557469310] [2022-12-06 05:24:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:03,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:03,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:03,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:03,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:03,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:03,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:03,509 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:03,509 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:03,515 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 05:24:03,521 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:03,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:03,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:03,522 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:03,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:03,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 05:24:03,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:03,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 05:24:03,550 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:03,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:03,550 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:03,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:03,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:03,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:03,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:03,575 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:03,575 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:03,576 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 05:24:03,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:03,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:03,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:03,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:24:03,725 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:03,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:03,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:03,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:03,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2022-12-06 05:24:03,725 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 05:24:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 169356384, now seen corresponding path program 1 times [2022-12-06 05:24:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:03,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469542767] [2022-12-06 05:24:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:03,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 05:24:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469542767] [2022-12-06 05:24:03,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469542767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:03,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:03,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368879497] [2022-12-06 05:24:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:03,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:03,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:03,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:03,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:03,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 05:24:03,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:03,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:04,060 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:04,060 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:04,067 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 05:24:04,074 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:04,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:04,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:04,074 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:04,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:04,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 05:24:04,106 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,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 05:24:04,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:04,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:04,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:04,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:04,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,131 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:04,131 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:24:04,132 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 05:24:04,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:04,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:04,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:24:04,274 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:04,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 05:24:04,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:04,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 05:24:04,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2022-12-06 05:24:04,274 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 05:24:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1912166719, now seen corresponding path program 1 times [2022-12-06 05:24:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:04,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374827398] [2022-12-06 05:24:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:04,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 05:24:04,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:04,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374827398] [2022-12-06 05:24:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374827398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:04,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:04,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689506576] [2022-12-06 05:24:04,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:04,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:04,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:04,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:04,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 05:24:04,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:04,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:04,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:04,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:04,587 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:04,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 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 05:24:04,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:04,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:04,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:04,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 05:24:04,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:04,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:04,634 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:04,634 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:04,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:04,634 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:04,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:04,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,658 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:04,659 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:24:04,659 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 05:24:04,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:04,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:04,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:04,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:24:04,801 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:04,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 05:24:04,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:04,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:04,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2022-12-06 05:24:04,801 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 05:24:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:04,801 INFO L85 PathProgramCache]: Analyzing trace with hash -639990242, now seen corresponding path program 1 times [2022-12-06 05:24:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:04,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522003804] [2022-12-06 05:24:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:04,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 05:24:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522003804] [2022-12-06 05:24:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522003804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:04,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:04,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449331116] [2022-12-06 05:24:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:04,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:04,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:04,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:04,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:04,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:04,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:04,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:04,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:04,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:05,153 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:05,153 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:05,159 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 05:24:05,166 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:05,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:05,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:05,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 05:24:05,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:05,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 05:24:05,197 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,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 05:24:05,197 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:05,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:05,197 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:05,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:05,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,222 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:05,222 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:05,223 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 05:24:05,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:05,374 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:05,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:24:05,374 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:05,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 05:24:05,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:05,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:05,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2022-12-06 05:24:05,375 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 05:24:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1102820093, now seen corresponding path program 1 times [2022-12-06 05:24:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:05,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094559866] [2022-12-06 05:24:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:05,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 05:24:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:05,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094559866] [2022-12-06 05:24:05,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094559866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:05,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:05,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984400227] [2022-12-06 05:24:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:05,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:05,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 05:24:05,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:05,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:05,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:05,722 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:05,722 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:05,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 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 05:24:05,738 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:05,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:05,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:05,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 05:24:05,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:05,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:05,773 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:05,773 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:05,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:05,773 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:05,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:05,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,799 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:05,799 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:05,800 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 05:24:05,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:05,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:06,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:06,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 05:24:06,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:06,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 05:24:06,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:06,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 05:24:06,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2022-12-06 05:24:06,053 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 05:24:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1449336868, now seen corresponding path program 1 times [2022-12-06 05:24:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:06,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467338590] [2022-12-06 05:24:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:06,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 05:24:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:06,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467338590] [2022-12-06 05:24:06,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467338590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:06,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:06,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658527143] [2022-12-06 05:24:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:06,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:06,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:06,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 05:24:06,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:06,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:06,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:06,390 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:06,390 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:06,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:06,405 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:06,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:06,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:06,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 05:24:06,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:06,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:06,441 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:06,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:06,441 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:06,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:06,441 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:06,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:06,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:06,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:06,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:06,466 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:06,466 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:24:06,467 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 05:24:06,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:06,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:06,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:06,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:06,619 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:06,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:06,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:06,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:06,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2022-12-06 05:24:06,619 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 05:24:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 293473467, now seen corresponding path program 1 times [2022-12-06 05:24:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:06,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047200576] [2022-12-06 05:24:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:06,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 05:24:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:06,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047200576] [2022-12-06 05:24:06,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047200576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:06,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:06,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081442567] [2022-12-06 05:24:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:06,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:06,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:06,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:06,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:06,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 05:24:06,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:06,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:06,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:06,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:06,956 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:06,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:06,970 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:06,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:06,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:06,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 05:24:06,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:07,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:07,003 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,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 05:24:07,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:07,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:07,003 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:07,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:07,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,028 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:07,028 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:07,029 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 05:24:07,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:07,177 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:07,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:24:07,178 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:07,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 05:24:07,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:07,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 05:24:07,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2022-12-06 05:24:07,178 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 05:24:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:07,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2036283802, now seen corresponding path program 1 times [2022-12-06 05:24:07,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:07,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886502936] [2022-12-06 05:24:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:07,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 05:24:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886502936] [2022-12-06 05:24:07,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886502936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:07,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:07,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544292311] [2022-12-06 05:24:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:07,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:07,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:07,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 05:24:07,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:07,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:07,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:07,514 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:07,514 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:07,522 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 05:24:07,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:07,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:07,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:07,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 05:24:07,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:07,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 05:24:07,563 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:07,563 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:07,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:07,564 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:07,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:07,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,588 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:07,588 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:24:07,589 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 05:24:07,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:07,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:07,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:07,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:24:07,731 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:07,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:07,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 05:24:07,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2022-12-06 05:24:07,732 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 05:24:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash -515873159, now seen corresponding path program 1 times [2022-12-06 05:24:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610591403] [2022-12-06 05:24:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610591403] [2022-12-06 05:24:07,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610591403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:07,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:07,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645448017] [2022-12-06 05:24:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:07,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:07,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:07,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 05:24:07,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:07,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:07,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:08,088 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:08,088 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:08,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 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 05:24:08,101 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:08,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:08,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:08,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 05:24:08,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:08,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 05:24:08,132 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,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 05:24:08,132 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:08,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:08,132 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:08,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:08,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,158 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:08,158 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:24:08,159 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 05:24:08,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:08,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:08,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:08,315 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:08,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:08,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:08,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:08,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2022-12-06 05:24:08,316 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 05:24:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1226937176, now seen corresponding path program 1 times [2022-12-06 05:24:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:08,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65408412] [2022-12-06 05:24:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:08,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 05:24:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:08,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65408412] [2022-12-06 05:24:08,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65408412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:08,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:08,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27805348] [2022-12-06 05:24:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:08,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:08,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:08,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:08,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 05:24:08,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:08,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:08,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:08,649 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:08,649 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:08,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 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 05:24:08,662 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:08,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:08,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:08,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 05:24:08,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:08,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 05:24:08,696 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,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 05:24:08,696 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:08,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:08,696 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:08,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:08,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,721 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:08,721 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:08,722 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 05:24:08,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:08,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:08,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:08,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:24:08,868 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:08,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 05:24:08,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:08,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 05:24:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2022-12-06 05:24:08,868 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 05:24:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219785, now seen corresponding path program 1 times [2022-12-06 05:24:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:08,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873469263] [2022-12-06 05:24:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:08,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 05:24:08,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:08,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873469263] [2022-12-06 05:24:08,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873469263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:08,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:08,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989415653] [2022-12-06 05:24:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:08,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:08,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:08,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 05:24:08,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:08,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:08,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:09,192 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:09,192 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:09,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:09,207 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:09,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:09,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24: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 05:24:09,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:09,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 05:24:09,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,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 05:24:09,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:09,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:09,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:09,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:09,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,266 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:09,266 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 05:24:09,267 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 05:24:09,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:09,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:09,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:09,417 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:09,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 05:24:09,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:09,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 05:24:09,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2022-12-06 05:24:09,418 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 05:24:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash 417590550, now seen corresponding path program 1 times [2022-12-06 05:24:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:09,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163728509] [2022-12-06 05:24:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:09,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163728509] [2022-12-06 05:24:09,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163728509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:09,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:09,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757190004] [2022-12-06 05:24:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:09,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:09,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:09,480 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:09,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:09,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:09,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:09,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:09,745 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:09,745 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:09,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 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 05:24:09,759 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:09,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:09,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:09,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 05:24:09,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:09,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 05:24:09,792 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,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 05:24:09,792 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:09,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:09,792 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:09,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:09,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:09,818 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:24:09,819 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 05:24:09,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:09,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:09,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:09,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:24:09,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:09,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 05:24:09,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:09,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 05:24:09,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2022-12-06 05:24:09,967 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 05:24:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2134566411, now seen corresponding path program 1 times [2022-12-06 05:24:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:09,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349003907] [2022-12-06 05:24:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:10,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 05:24:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349003907] [2022-12-06 05:24:10,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349003907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:10,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:10,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272053345] [2022-12-06 05:24:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:10,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:10,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:10,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 05:24:10,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:10,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:10,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:10,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:10,319 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:10,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 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 05:24:10,334 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:10,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:10,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:10,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 05:24:10,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:10,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:10,370 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,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 05:24:10,370 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:10,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:10,370 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:10,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:10,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,395 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:10,395 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:24:10,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 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 05:24:10,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:10,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:10,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:24:10,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:10,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 05:24:10,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:10,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 05:24:10,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2022-12-06 05:24:10,552 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 05:24:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash -391756076, now seen corresponding path program 1 times [2022-12-06 05:24:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:10,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795603402] [2022-12-06 05:24:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:10,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 05:24:10,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:10,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795603402] [2022-12-06 05:24:10,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795603402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:10,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:10,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593199991] [2022-12-06 05:24:10,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:10,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:10,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:10,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:10,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 05:24:10,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:10,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:10,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:10,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:10,906 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:10,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 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 05:24:10,921 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:10,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:10,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:10,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 05:24:10,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:10,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 05:24:10,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,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 05:24:10,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:10,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:10,955 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:10,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:10,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,990 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:10,991 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:24:10,992 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 05:24:10,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:10,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:11,145 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:11,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:24:11,145 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:11,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:11,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2022-12-06 05:24:11,146 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 05:24:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1351054259, now seen corresponding path program 1 times [2022-12-06 05:24:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:11,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61497148] [2022-12-06 05:24:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24: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 05:24:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61497148] [2022-12-06 05:24:11,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61497148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:11,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:11,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389768757] [2022-12-06 05:24:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:11,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:11,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:11,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 05:24:11,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:11,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:11,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:11,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:11,496 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:11,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:11,511 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:11,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:11,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24: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 05:24:11,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24: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 05:24:11,547 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24: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 05:24:11,547 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:11,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:11,547 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:11,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:11,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:11,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:11,572 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:11,572 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 05:24:11,573 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 05:24:11,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:11,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:11,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:11,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:11,730 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:11,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 05:24:11,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:11,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 05:24:11,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2022-12-06 05:24:11,730 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 05:24:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1201102702, now seen corresponding path program 1 times [2022-12-06 05:24:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:11,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767980057] [2022-12-06 05:24:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:11,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 05:24:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:11,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767980057] [2022-12-06 05:24:11,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767980057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:11,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:11,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014805132] [2022-12-06 05:24:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:11,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:11,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:11,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:11,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 05:24:11,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:11,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:11,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:12,067 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:12,067 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:12,074 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 05:24:12,083 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:12,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:12,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:12,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 05:24:12,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:12,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 05:24:12,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,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 05:24:12,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:12,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:12,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:12,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:12,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,156 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:12,156 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:12,158 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 05:24:12,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:12,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:12,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 05:24:12,337 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:12,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 05:24:12,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:12,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 05:24:12,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2022-12-06 05:24:12,338 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 05:24:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 541707633, now seen corresponding path program 1 times [2022-12-06 05:24:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609869767] [2022-12-06 05:24:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:12,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 05:24:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609869767] [2022-12-06 05:24:12,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609869767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:12,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:12,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026213387] [2022-12-06 05:24:12,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:12,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:12,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:12,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 05:24:12,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:12,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:12,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:12,687 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:12,687 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:12,693 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 05:24:12,700 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:12,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:12,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:12,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 05:24:12,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:12,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 05:24:12,730 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,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 05:24:12,730 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:12,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:12,730 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:12,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:12,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,755 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:12,755 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:24:12,756 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 05:24:12,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:12,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:12,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:12,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:24:12,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:12,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 05:24:12,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:12,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 05:24:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2022-12-06 05:24:12,921 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 05:24:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2010449328, now seen corresponding path program 1 times [2022-12-06 05:24:12,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:12,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884382858] [2022-12-06 05:24:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:12,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:12,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 05:24:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:12,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884382858] [2022-12-06 05:24:12,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884382858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:12,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:12,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327375134] [2022-12-06 05:24:12,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:12,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:12,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 05:24:12,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:12,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:12,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:13,263 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:13,263 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:13,270 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 05:24:13,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:13,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:13,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:13,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 05:24:13,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:13,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 05:24:13,312 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,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 05:24:13,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:13,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:13,313 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:13,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:13,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,337 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:13,338 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:24:13,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 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 05:24:13,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:13,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:13,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:13,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:13,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 05:24:13,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:13,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 05:24:13,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2022-12-06 05:24:13,493 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 05:24:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash -267638993, now seen corresponding path program 1 times [2022-12-06 05:24:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:13,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696323133] [2022-12-06 05:24:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:13,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 05:24:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:13,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696323133] [2022-12-06 05:24:13,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696323133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:13,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:13,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:13,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556033112] [2022-12-06 05:24:13,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:13,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:13,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:13,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:13,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:13,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 05:24:13,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:13,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:13,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:13,819 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:13,820 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:13,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:13,833 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:13,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:13,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:13,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 05:24:13,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:13,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 05:24:13,867 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,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 05:24:13,867 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:13,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:13,867 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:13,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:13,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,892 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:13,892 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:24:13,893 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 05:24:13,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:13,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:14,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:14,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:14,050 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:14,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 05:24:14,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:14,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 05:24:14,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2022-12-06 05:24:14,051 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 05:24:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1475171342, now seen corresponding path program 1 times [2022-12-06 05:24:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:14,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122884300] [2022-12-06 05:24:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:14,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 05:24:14,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:14,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122884300] [2022-12-06 05:24:14,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122884300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:14,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:14,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:14,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668668437] [2022-12-06 05:24:14,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:14,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:14,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:14,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:14,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 05:24:14,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:14,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:14,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:14,402 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:14,402 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:14,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 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 05:24:14,417 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:14,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:14,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:14,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 05:24:14,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:14,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 05:24:14,451 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:14,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 05:24:14,452 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:14,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:14,452 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:14,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:14,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:14,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:14,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:14,476 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:14,477 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:14,478 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 05:24:14,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:14,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:14,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:14,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:24:14,618 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:14,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:14,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:14,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2022-12-06 05:24:14,619 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 05:24:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1076985619, now seen corresponding path program 1 times [2022-12-06 05:24:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:14,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833431080] [2022-12-06 05:24:14,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:14,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 05:24:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833431080] [2022-12-06 05:24:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833431080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:14,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:14,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22917339] [2022-12-06 05:24:14,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:14,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:14,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:14,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:14,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:14,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 05:24:14,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:14,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:14,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:14,970 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:14,970 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:14,986 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:14,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:14,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:14,987 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:14,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:15,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:15,021 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:15,022 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:15,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:15,022 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:15,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:15,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,047 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:15,047 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:24:15,048 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 05:24:15,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:15,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:15,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:15,199 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:15,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 05:24:15,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:15,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 05:24:15,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2022-12-06 05:24:15,199 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 05:24:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 665824716, now seen corresponding path program 1 times [2022-12-06 05:24:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:15,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101473630] [2022-12-06 05:24:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:15,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:15,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 05:24:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:15,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101473630] [2022-12-06 05:24:15,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101473630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:15,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:15,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971483806] [2022-12-06 05:24:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:15,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:15,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:15,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 05:24:15,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:15,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:15,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:15,550 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:15,550 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:15,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:15,564 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:15,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:15,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:15,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 05:24:15,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:15,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 05:24:15,598 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:15,598 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:15,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:15,598 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:15,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:15,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,632 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:15,632 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:15,633 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 05:24:15,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:15,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:15,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:15,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:24:15,786 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:15,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 05:24:15,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:15,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 05:24:15,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2022-12-06 05:24:15,786 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 05:24:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1886332245, now seen corresponding path program 1 times [2022-12-06 05:24:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:15,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168348025] [2022-12-06 05:24:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:15,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 05:24:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168348025] [2022-12-06 05:24:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168348025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:15,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:15,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450343931] [2022-12-06 05:24:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:15,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:15,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:15,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:15,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 05:24:15,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:15,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:15,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:16,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:16,128 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:16,135 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 05:24:16,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:16,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:16,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:16,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 05:24:16,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:16,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:16,179 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:16,179 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:16,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:16,179 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:16,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:16,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,204 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:16,204 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:16,205 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 05:24:16,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:16,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:16,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:24:16,352 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:16,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 05:24:16,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:16,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 05:24:16,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2022-12-06 05:24:16,352 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 05:24:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -143521910, now seen corresponding path program 1 times [2022-12-06 05:24:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:16,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107016713] [2022-12-06 05:24:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:16,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 05:24:16,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:16,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107016713] [2022-12-06 05:24:16,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107016713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:16,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332984848] [2022-12-06 05:24:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:16,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:16,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:16,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 05:24:16,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:16,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:16,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:16,683 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:16,684 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:16,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:16,699 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:16,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:16,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:16,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 05:24:16,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:16,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 05:24:16,733 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:16,733 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:16,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:16,733 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:16,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:16,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,758 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:16,758 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:24:16,759 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 05:24:16,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:16,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:16,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:16,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:24:16,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:16,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 05:24:16,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:16,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 05:24:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2022-12-06 05:24:16,901 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 05:24:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1599288425, now seen corresponding path program 1 times [2022-12-06 05:24:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:16,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929971968] [2022-12-06 05:24:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:16,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 05:24:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:16,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929971968] [2022-12-06 05:24:16,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929971968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:16,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:16,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:16,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842983015] [2022-12-06 05:24:16,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:16,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:16,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:16,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:16,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:16,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 05:24:16,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:16,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:17,265 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:17,266 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:24:17,271 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 05:24:17,277 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:17,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:17,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:17,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 05:24:17,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:17,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:17,308 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:17,308 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:17,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:17,308 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:17,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:17,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,333 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:17,333 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:17,334 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 05:24:17,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:17,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:17,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:24:17,489 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:17,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 05:24:17,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:17,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 05:24:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2022-12-06 05:24:17,489 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 05:24:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash -952868536, now seen corresponding path program 1 times [2022-12-06 05:24:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359621067] [2022-12-06 05:24:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:17,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 05:24:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:17,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359621067] [2022-12-06 05:24:17,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359621067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:17,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:17,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58676146] [2022-12-06 05:24:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:17,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:17,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:17,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:17,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:17,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 05:24:17,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:17,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:17,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:17,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:17,825 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:17,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:17,840 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:17,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:17,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:17,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 05:24:17,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:17,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 05:24:17,874 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,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 05:24:17,874 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:17,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:17,874 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:17,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:17,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,899 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:17,899 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:24:17,900 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 05:24:17,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:17,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:18,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:18,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:24:18,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:18,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 05:24:18,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:18,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 05:24:18,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2022-12-06 05:24:18,054 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 05:24:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash 789941799, now seen corresponding path program 1 times [2022-12-06 05:24:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:18,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399749083] [2022-12-06 05:24:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:18,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 05:24:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:18,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399749083] [2022-12-06 05:24:18,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399749083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:18,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:18,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:18,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653963913] [2022-12-06 05:24:18,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:18,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:18,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:18,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:18,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 05:24:18,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:18,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:18,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:18,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:18,375 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:18,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 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 05:24:18,389 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:18,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:18,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:18,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 05:24:18,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:18,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:18,423 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:18,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:18,423 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:18,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:18,423 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:18,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:18,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:18,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:18,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:18,448 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:18,448 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:24:18,449 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 05:24:18,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:18,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:18,611 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:18,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:24:18,612 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:18,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 05:24:18,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:18,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 05:24:18,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2022-12-06 05:24:18,612 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 05:24:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1762215162, now seen corresponding path program 1 times [2022-12-06 05:24:18,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:18,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916704749] [2022-12-06 05:24:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:18,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 05:24:18,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:18,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916704749] [2022-12-06 05:24:18,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916704749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:18,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:18,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108706548] [2022-12-06 05:24:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:18,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:18,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:18,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 05:24:18,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:18,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:18,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:18,957 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:18,957 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:18,964 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 05:24:18,972 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:18,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:18,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:18,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 05:24:18,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:19,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 05:24:19,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,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 05:24:19,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:19,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:19,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:19,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:19,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,032 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:19,032 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:19,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 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 05:24:19,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:19,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:19,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:19,186 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:19,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:19,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:19,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2022-12-06 05:24:19,186 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 05:24:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash -19404827, now seen corresponding path program 1 times [2022-12-06 05:24:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:19,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429885049] [2022-12-06 05:24:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:19,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 05:24:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:19,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429885049] [2022-12-06 05:24:19,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429885049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:19,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:19,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905394199] [2022-12-06 05:24:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:19,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:19,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 05:24:19,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:19,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:19,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:19,514 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:19,514 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:24:19,521 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 05:24:19,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:19,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:19,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:19,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 05:24:19,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:19,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 05:24:19,564 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,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 05:24:19,564 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:19,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:19,564 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:19,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:19,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,589 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:19,589 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:19,590 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 05:24:19,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:19,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:19,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:19,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:19,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:19,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 05:24:19,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:19,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 05:24:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2022-12-06 05:24:19,743 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 05:24:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1723405508, now seen corresponding path program 1 times [2022-12-06 05:24:19,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:19,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662647903] [2022-12-06 05:24:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:19,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 05:24:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662647903] [2022-12-06 05:24:19,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662647903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:19,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:19,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625218614] [2022-12-06 05:24:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:19,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:19,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:19,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:19,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 05:24:19,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:19,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:19,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:20,089 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:20,089 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:20,096 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 05:24:20,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:20,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:20,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:20,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 05:24:20,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:20,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 05:24:20,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,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 05:24:20,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:20,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:20,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:20,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:20,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,170 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:20,170 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:24:20,171 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 05:24:20,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:20,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:20,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:24:20,329 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:20,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:20,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:20,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:20,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2022-12-06 05:24:20,329 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 05:24:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -828751453, now seen corresponding path program 1 times [2022-12-06 05:24:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:20,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163433241] [2022-12-06 05:24:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:20,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 05:24:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:20,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163433241] [2022-12-06 05:24:20,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163433241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:20,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:20,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903028653] [2022-12-06 05:24:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:20,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:20,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:20,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:20,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 05:24:20,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:20,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:20,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:20,655 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:20,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:20,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 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 05:24:20,669 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:20,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:20,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:20,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 05:24:20,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:20,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 05:24:20,704 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,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 05:24:20,704 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:20,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:20,704 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:20,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:20,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,729 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:20,729 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:24:20,730 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 05:24:20,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:20,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:20,890 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:20,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:24:20,891 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:20,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:20,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:20,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 05:24:20,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2022-12-06 05:24:20,891 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 05:24:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 914058882, now seen corresponding path program 1 times [2022-12-06 05:24:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:20,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800348892] [2022-12-06 05:24:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:20,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 05:24:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800348892] [2022-12-06 05:24:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800348892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:20,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:20,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268157047] [2022-12-06 05:24:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:20,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:20,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 05:24:20,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:20,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:20,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:21,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:21,241 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:21,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:21,256 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:21,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:21,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:21,257 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:21,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:21,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:21,289 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,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 05:24:21,289 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:21,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:21,289 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:21,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:21,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,314 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:21,315 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:24:21,316 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 05:24:21,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:21,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:21,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:24:21,470 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:21,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 05:24:21,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:21,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 05:24:21,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2022-12-06 05:24:21,470 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 05:24:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1638098079, now seen corresponding path program 1 times [2022-12-06 05:24:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:21,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077190705] [2022-12-06 05:24:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:21,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 05:24:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:21,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077190705] [2022-12-06 05:24:21,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077190705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:21,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:21,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393893077] [2022-12-06 05:24:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:21,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:21,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:21,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:21,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:21,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:21,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:21,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:21,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:21,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:21,827 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:21,827 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:21,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 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 05:24:21,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:21,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:21,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:21,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:21,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 05:24:21,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:21,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 05:24:21,869 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,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 05:24:21,869 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:21,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:21,869 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:21,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:21,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,894 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:21,894 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:21,895 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 05:24:21,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:21,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:22,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:22,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:24:22,040 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:22,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 05:24:22,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:22,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 05:24:22,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2022-12-06 05:24:22,041 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 05:24:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 104712256, now seen corresponding path program 1 times [2022-12-06 05:24:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:22,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050647176] [2022-12-06 05:24:22,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:22,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:22,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 05:24:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:22,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050647176] [2022-12-06 05:24:22,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050647176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:22,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:22,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181401612] [2022-12-06 05:24:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:22,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:22,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:22,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 05:24:22,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:22,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:22,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:22,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:22,384 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:22,390 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 05:24:22,398 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:22,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:22,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:22,399 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:22,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:22,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 05:24:22,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:22,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 05:24:22,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:22,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:22,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:22,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:22,432 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:22,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:22,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:22,457 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:22,457 INFO L131 PetriNetUnfolder]: For 3141/3284 co-relation queries the response was YES. [2022-12-06 05:24:22,458 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 05:24:22,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:22,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:22,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:22,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:22,609 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:22,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:22,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:22,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:22,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2022-12-06 05:24:22,609 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 05:24:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:22,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1847522591, now seen corresponding path program 1 times [2022-12-06 05:24:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:22,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458130763] [2022-12-06 05:24:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:22,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458130763] [2022-12-06 05:24:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458130763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:22,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:22,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345997775] [2022-12-06 05:24:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:22,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:22,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:22,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:22,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:22,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 05:24:22,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:22,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:22,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:22,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:22,961 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:22,968 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 05:24:22,976 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:22,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:22,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:22,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 05:24:22,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:23,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 05:24:23,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,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 05:24:23,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:23,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:23,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:23,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:23,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,035 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:23,035 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:23,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 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 05:24:23,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:23,187 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:23,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:23,188 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:23,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 05:24:23,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:23,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 05:24:23,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2022-12-06 05:24:23,188 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 05:24:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -704634370, now seen corresponding path program 1 times [2022-12-06 05:24:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808152578] [2022-12-06 05:24:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:23,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808152578] [2022-12-06 05:24:23,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808152578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:23,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:23,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:23,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862935464] [2022-12-06 05:24:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:23,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:23,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:23,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:23,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:23,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:23,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:23,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:23,538 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:23,538 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:23,545 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 05:24:23,553 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:23,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:23,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:23,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 05:24:23,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:23,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 05:24:23,585 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:23,585 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:23,586 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:23,586 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:23,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:23,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,611 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:23,611 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:23,612 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 05:24:23,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:23,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:23,760 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:23,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:24:23,761 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:23,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 05:24:23,761 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:23,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 05:24:23,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2022-12-06 05:24:23,761 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 05:24:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1038175965, now seen corresponding path program 1 times [2022-12-06 05:24:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567330283] [2022-12-06 05:24:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:23,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 05:24:23,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:23,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567330283] [2022-12-06 05:24:23,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567330283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:23,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:23,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743628126] [2022-12-06 05:24:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:23,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:23,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:23,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 05:24:23,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:23,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:23,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:24,099 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:24,100 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:24,107 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 05:24:24,116 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:24,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:24,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:24,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 05:24:24,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:24,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:24,151 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:24,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:24,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:24,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:24,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:24,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,176 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:24,176 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:24,177 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 05:24:24,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:24,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:24,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:24,329 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:24,329 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:24,329 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:24,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2022-12-06 05:24:24,329 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 05:24:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1513980996, now seen corresponding path program 1 times [2022-12-06 05:24:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:24,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860858772] [2022-12-06 05:24:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:24,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860858772] [2022-12-06 05:24:24,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860858772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:24,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:24,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116841886] [2022-12-06 05:24:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:24,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:24,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:24,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:24,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:24,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:24,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:24,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:24,665 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:24,665 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:24,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 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 05:24:24,708 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:24,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:24,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:24,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 05:24:24,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:24,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 05:24:24,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,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 05:24:24,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:24,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:24,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:24,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:24,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,762 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:24,762 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:24,763 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 05:24:24,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:24,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:24,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:24,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:24:24,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:24,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 05:24:24,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:24,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 05:24:24,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2022-12-06 05:24:24,921 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 05:24:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 228829339, now seen corresponding path program 1 times [2022-12-06 05:24:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:24,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117268851] [2022-12-06 05:24:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:24,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 05:24:24,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:24,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117268851] [2022-12-06 05:24:24,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117268851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:24,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:24,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230501367] [2022-12-06 05:24:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:24,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:24,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:24,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 05:24:24,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:24,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:24,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:25,253 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:25,253 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:25,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 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 05:24:25,267 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:25,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:25,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:25,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 05:24:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:25,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 05:24:25,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,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 05:24:25,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:25,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:25,298 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:25,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:25,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,323 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:25,323 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:25,324 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 05:24:25,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:25,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:25,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:25,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 05:24:25,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:25,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 05:24:25,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable865 [2022-12-06 05:24:25,474 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 05:24:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1971639674, now seen corresponding path program 1 times [2022-12-06 05:24:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423687031] [2022-12-06 05:24:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:25,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 05:24:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:25,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423687031] [2022-12-06 05:24:25,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423687031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:25,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:25,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294445658] [2022-12-06 05:24:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:25,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:25,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:25,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:25,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 05:24:25,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:25,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:25,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:25,816 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:25,816 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:24:25,822 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 05:24:25,830 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:25,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:25,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:25,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 05:24:25,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:25,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:25,861 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:25,861 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:25,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:25,861 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:25,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:25,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,886 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:25,886 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:25,887 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 05:24:25,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:25,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:26,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:26,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:26,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:26,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 05:24:26,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:26,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 05:24:26,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2022-12-06 05:24:26,038 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 05:24:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -580517287, now seen corresponding path program 1 times [2022-12-06 05:24:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:26,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563754542] [2022-12-06 05:24:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:26,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 05:24:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:26,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563754542] [2022-12-06 05:24:26,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563754542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:26,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:26,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17620329] [2022-12-06 05:24:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:26,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:26,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:26,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 05:24:26,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:26,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:26,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:26,379 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:26,379 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:26,386 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 05:24:26,392 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:26,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:26,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:26,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 05:24:26,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:26,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:26,425 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:26,425 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:26,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:26,425 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:26,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:26,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,450 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:26,450 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:26,451 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 05:24:26,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:26,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:26,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:24:26,598 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:26,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 05:24:26,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:26,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 05:24:26,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2022-12-06 05:24:26,598 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 05:24:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:26,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1162293048, now seen corresponding path program 1 times [2022-12-06 05:24:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:26,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456559980] [2022-12-06 05:24:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:26,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 05:24:26,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:26,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456559980] [2022-12-06 05:24:26,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456559980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:26,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:26,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117152959] [2022-12-06 05:24:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:26,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:26,661 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:26,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 05:24:26,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:26,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:26,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:26,923 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:26,923 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:26,930 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 05:24:26,936 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:26,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:26,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:26,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 05:24:26,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:26,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 05:24:26,970 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,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 05:24:26,971 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:26,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:26,971 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:26,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:26,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,995 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:26,995 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:24:26,996 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 05:24:26,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:26,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:27,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:27,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:27,149 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:27,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:27,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:27,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:27,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2022-12-06 05:24:27,149 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 05:24:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1389863913, now seen corresponding path program 1 times [2022-12-06 05:24:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:27,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047263929] [2022-12-06 05:24:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:27,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 05:24:27,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:27,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047263929] [2022-12-06 05:24:27,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047263929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:27,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:27,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021438081] [2022-12-06 05:24:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:27,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:27,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:27,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:27,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:27,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:27,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 05:24:27,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:27,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:27,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:27,499 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:27,499 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:27,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 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 05:24:27,512 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:27,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:27,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:27,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 05:24:27,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:27,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 05:24:27,546 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:27,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 05:24:27,546 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:27,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:27,546 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:27,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:27,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:27,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:27,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:27,570 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:27,571 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:24:27,572 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 05:24:27,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:27,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:27,719 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:27,720 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:24:27,720 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:27,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 05:24:27,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:27,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:27,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2022-12-06 05:24:27,720 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 05:24:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 352946422, now seen corresponding path program 1 times [2022-12-06 05:24:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984450592] [2022-12-06 05:24:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:27,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984450592] [2022-12-06 05:24:27,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984450592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:27,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:27,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687944245] [2022-12-06 05:24:27,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:27,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:27,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:27,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:27,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:27,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:27,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:28,050 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:28,050 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:28,065 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:28,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:28,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:28,066 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:28,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:28,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:28,099 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:28,100 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:28,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:28,100 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,100 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:28,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:28,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,124 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:28,124 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:24:28,125 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 05:24:28,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:28,268 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:28,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:24:28,268 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:28,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 05:24:28,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:28,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 05:24:28,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2022-12-06 05:24:28,268 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 05:24:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2095756757, now seen corresponding path program 1 times [2022-12-06 05:24:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:28,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735713586] [2022-12-06 05:24:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:28,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 05:24:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:28,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735713586] [2022-12-06 05:24:28,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735713586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:28,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:28,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254587295] [2022-12-06 05:24:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:28,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:28,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:28,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:28,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:28,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:28,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 05:24:28,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:28,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:28,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:28,655 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:28,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:28,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 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 05:24:28,669 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:28,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:28,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:28,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 05:24:28,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:28,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 05:24:28,702 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,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 05:24:28,702 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:28,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:28,703 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:28,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:28,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,727 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:28,728 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:28,729 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 05:24:28,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:28,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:28,890 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:28,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:24:28,891 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:28,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:28,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:28,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 05:24:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2022-12-06 05:24:28,891 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 05:24:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -456400204, now seen corresponding path program 1 times [2022-12-06 05:24:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:28,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996555640] [2022-12-06 05:24:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:28,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 05:24:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:28,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996555640] [2022-12-06 05:24:28,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996555640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:28,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:28,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026537566] [2022-12-06 05:24:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:28,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:28,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:28,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 05:24:28,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:28,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:28,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:29,265 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:29,265 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:29,271 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 05:24:29,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:29,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:29,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:29,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 05:24:29,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:29,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:29,304 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:29,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:29,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:29,304 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:29,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:29,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,329 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:29,329 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:24:29,330 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 05:24:29,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:29,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:29,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:24:29,472 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:29,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 05:24:29,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:29,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 05:24:29,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2022-12-06 05:24:29,473 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 05:24:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1286410131, now seen corresponding path program 1 times [2022-12-06 05:24:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:29,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131322879] [2022-12-06 05:24:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131322879] [2022-12-06 05:24:29,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131322879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:29,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:29,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076752134] [2022-12-06 05:24:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:29,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:29,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:29,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:29,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:29,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:29,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:29,820 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:29,820 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:29,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:29,835 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:29,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:29,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:29,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 05:24:29,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:29,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 05:24:29,870 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,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 05:24:29,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:29,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:29,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:29,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:29,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,895 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:29,895 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:24:29,896 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 05:24:29,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:29,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:30,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:30,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:24:30,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:30,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 05:24:30,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:30,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 05:24:30,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2022-12-06 05:24:30,054 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 05:24:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1265746830, now seen corresponding path program 1 times [2022-12-06 05:24:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:30,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274284977] [2022-12-06 05:24:30,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:30,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274284977] [2022-12-06 05:24:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274284977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:30,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:30,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310536597] [2022-12-06 05:24:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:30,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:30,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:30,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 05:24:30,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:30,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:30,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:30,391 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:30,391 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:30,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 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 05:24:30,406 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:30,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:30,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:30,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 05:24:30,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:30,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:30,443 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:30,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:30,443 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:30,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:30,444 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:30,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:30,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:30,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:30,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:30,468 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:30,469 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:30,470 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 05:24:30,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:30,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:30,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:30,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:24:30,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:30,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 05:24:30,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:30,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 05:24:30,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2022-12-06 05:24:30,623 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 05:24:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash 477063505, now seen corresponding path program 1 times [2022-12-06 05:24:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:30,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95555363] [2022-12-06 05:24:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:30,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95555363] [2022-12-06 05:24:30,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95555363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:30,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:30,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015481748] [2022-12-06 05:24:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:30,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:30,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:30,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:30,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:30,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:30,970 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:30,970 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:30,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:30,984 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:30,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:30,985 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:30,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 05:24:30,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:31,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 05:24:31,017 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,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 05:24:31,017 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:31,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:31,017 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:31,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:31,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,043 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:31,044 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:24:31,045 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 05:24:31,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:31,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:31,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:31,195 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:31,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 05:24:31,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:31,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 05:24:31,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2022-12-06 05:24:31,195 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 05:24:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2075093456, now seen corresponding path program 1 times [2022-12-06 05:24:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:31,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599451173] [2022-12-06 05:24:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:31,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599451173] [2022-12-06 05:24:31,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599451173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:31,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:31,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700105333] [2022-12-06 05:24:31,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:31,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:31,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:31,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:31,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:31,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:31,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:31,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:31,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:31,525 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:31,531 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 05:24:31,537 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:31,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:31,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:31,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 05:24:31,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:31,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:31,572 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:31,572 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:31,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:31,572 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:31,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:31,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,597 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:31,597 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:24:31,598 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 05:24:31,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:31,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:31,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:31,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:31,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:31,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 05:24:31,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:31,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 05:24:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2022-12-06 05:24:31,755 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 05:24:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -332283121, now seen corresponding path program 1 times [2022-12-06 05:24:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:31,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87626356] [2022-12-06 05:24:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:31,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 05:24:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87626356] [2022-12-06 05:24:31,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87626356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:31,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:31,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452373877] [2022-12-06 05:24:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:31,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:31,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:31,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:31,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:31,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 05:24:31,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:31,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:31,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:32,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:32,097 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:32,104 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 05:24:32,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:32,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:32,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:32,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 05:24:32,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24: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 05:24:32,143 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:32,143 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:32,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:32,143 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,143 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:32,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:32,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,178 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:32,178 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:32,179 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 05:24:32,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:32,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:32,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:24:32,318 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:32,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 05:24:32,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:32,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 05:24:32,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2022-12-06 05:24:32,318 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 05:24:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1410527214, now seen corresponding path program 1 times [2022-12-06 05:24:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:32,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565230915] [2022-12-06 05:24:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:32,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 05:24:32,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565230915] [2022-12-06 05:24:32,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565230915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:32,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:32,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194280120] [2022-12-06 05:24:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:32,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:32,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:32,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 05:24:32,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:32,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:32,653 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:32,653 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:24:32,660 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 05:24:32,668 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:32,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:32,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:32,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 05:24:32,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:32,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 05:24:32,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,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 05:24:32,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:32,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:32,699 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:32,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:32,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,724 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:32,724 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:24:32,725 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 05:24:32,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:32,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:32,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:32,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:32,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:32,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 05:24:32,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:32,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 05:24:32,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2022-12-06 05:24:32,883 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 05:24:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1141629747, now seen corresponding path program 1 times [2022-12-06 05:24:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:32,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766155371] [2022-12-06 05:24:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:32,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 05:24:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766155371] [2022-12-06 05:24:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766155371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:32,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:32,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766500071] [2022-12-06 05:24:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:32,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:32,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:32,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:32,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:32,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:32,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:32,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:33,213 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:33,213 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:33,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 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 05:24:33,226 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:33,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:33,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:33,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 05:24:33,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:33,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 05:24:33,260 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:33,260 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:33,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:33,260 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:33,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:33,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,285 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:33,285 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:24:33,286 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 05:24:33,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:33,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:33,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:33,439 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:33,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:33,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:33,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:33,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2022-12-06 05:24:33,439 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 05:24:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 601180588, now seen corresponding path program 1 times [2022-12-06 05:24:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:33,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856981800] [2022-12-06 05:24:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:33,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 05:24:33,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:33,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856981800] [2022-12-06 05:24:33,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856981800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:33,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:33,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:33,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310165641] [2022-12-06 05:24:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:33,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:33,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:33,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 05:24:33,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:33,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:33,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:33,794 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:33,794 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:33,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:33,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:33,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:33,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:33,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 05:24:33,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:33,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:33,835 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:33,835 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:33,835 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:33,835 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:33,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:33,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,860 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:33,860 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:33,861 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 05:24:33,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:33,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:34,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:34,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:24:34,016 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:34,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 05:24:34,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:34,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 05:24:34,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2022-12-06 05:24:34,017 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 05:24:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1950976373, now seen corresponding path program 1 times [2022-12-06 05:24:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:34,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623286152] [2022-12-06 05:24:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623286152] [2022-12-06 05:24:34,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623286152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:34,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:34,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118602816] [2022-12-06 05:24:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:34,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:34,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:34,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:34,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:34,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:34,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:34,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:34,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:34,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:34,335 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:34,335 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:34,342 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 05:24:34,348 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:34,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:34,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:34,349 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:34,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:34,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 05:24:34,382 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,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 05:24:34,382 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:34,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:34,382 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:34,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:34,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,407 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:34,407 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:34,408 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 05:24:34,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:34,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:34,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:24:34,555 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:34,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 05:24:34,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:34,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 05:24:34,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2022-12-06 05:24:34,555 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 05:24:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -208166038, now seen corresponding path program 1 times [2022-12-06 05:24:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:34,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226453376] [2022-12-06 05:24:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:34,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 05:24:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:34,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226453376] [2022-12-06 05:24:34,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226453376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:34,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:34,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664737917] [2022-12-06 05:24:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:34,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:34,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:34,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:34,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:34,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:34,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 05:24:34,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:34,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:34,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:34,872 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:34,872 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:34,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 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 05:24:34,886 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:34,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:34,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:34,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 05:24:34,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:34,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:34,919 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:34,919 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:34,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:34,919 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:34,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:34,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,944 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:34,944 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:34,945 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 05:24:34,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:34,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:35,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:35,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:24:35,087 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:35,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 05:24:35,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:35,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 05:24:35,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2022-12-06 05:24:35,088 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 05:24:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1534644297, now seen corresponding path program 1 times [2022-12-06 05:24:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:35,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593442940] [2022-12-06 05:24:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:35,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 05:24:35,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:35,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593442940] [2022-12-06 05:24:35,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593442940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:35,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:35,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47962579] [2022-12-06 05:24:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:35,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:35,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:35,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:35,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:35,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:35,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 05:24:35,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:35,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:35,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:35,432 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:35,432 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:35,438 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 05:24:35,445 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:35,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:35,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:35,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:35,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 05:24:35,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:35,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:35,479 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:35,479 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:35,479 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:35,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:35,479 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:35,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:35,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:35,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:35,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:35,503 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:35,503 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:35,504 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 05:24:35,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:35,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:35,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:35,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:35,655 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:35,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 05:24:35,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:35,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 05:24:35,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2022-12-06 05:24:35,655 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 05:24:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1017512664, now seen corresponding path program 1 times [2022-12-06 05:24:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:35,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820084435] [2022-12-06 05:24:35,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:35,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820084435] [2022-12-06 05:24:35,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820084435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:35,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:35,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473515557] [2022-12-06 05:24:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:35,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:35,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:35,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 05:24:35,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:35,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:35,991 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:35,991 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:35,998 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 05:24:36,005 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:36,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:36,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:36,006 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:36,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:36,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 05:24:36,040 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,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 05:24:36,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:36,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:36,041 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:36,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:36,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,065 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:36,065 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 05:24:36,066 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 05:24:36,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:36,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:36,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:24:36,233 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:36,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:36,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:36,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:36,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2022-12-06 05:24:36,233 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 05:24:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 725297671, now seen corresponding path program 1 times [2022-12-06 05:24:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285623006] [2022-12-06 05:24:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:36,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 05:24:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285623006] [2022-12-06 05:24:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285623006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:36,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:36,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043413536] [2022-12-06 05:24:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:36,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:36,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:36,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:36,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:36,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:36,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 05:24:36,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:36,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:36,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:36,579 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:36,580 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:36,587 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 05:24:36,595 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:36,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:36,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:36,596 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:36,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:36,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:36,660 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:36,660 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:36,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:36,660 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:36,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:36,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,685 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:36,685 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:36,686 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 05:24:36,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:36,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:36,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:36,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:36,839 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:36,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 05:24:36,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:36,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 05:24:36,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2022-12-06 05:24:36,840 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 05:24:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1826859290, now seen corresponding path program 1 times [2022-12-06 05:24:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:36,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777248844] [2022-12-06 05:24:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777248844] [2022-12-06 05:24:36,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777248844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:36,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043858504] [2022-12-06 05:24:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:36,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:36,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:36,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 05:24:36,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:36,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:36,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:37,193 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:37,194 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:37,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:37,208 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:37,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:37,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:37,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 05:24:37,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24: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 05:24:37,240 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24: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 05:24:37,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:37,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:37,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:37,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:37,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,267 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:37,267 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:37,268 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 05:24:37,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,270 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:37,409 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:37,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:24:37,409 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:37,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 05:24:37,410 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:37,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 05:24:37,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2022-12-06 05:24:37,410 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 05:24:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -84048955, now seen corresponding path program 1 times [2022-12-06 05:24:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:37,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068733820] [2022-12-06 05:24:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068733820] [2022-12-06 05:24:37,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068733820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:37,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:37,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:37,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294866893] [2022-12-06 05:24:37,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:37,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:37,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:37,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:37,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:37,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:37,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:37,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:37,752 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:37,759 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 05:24:37,767 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:37,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:37,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:37,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 05:24:37,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:37,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 05:24:37,801 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,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 05:24:37,801 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:37,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:37,801 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:37,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:37,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,826 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:37,826 INFO L131 PetriNetUnfolder]: For 3112/3253 co-relation queries the response was YES. [2022-12-06 05:24:37,827 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 05:24:37,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:37,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:37,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:37,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:24:37,974 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:37,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:37,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:37,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:37,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2022-12-06 05:24:37,974 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 05:24:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1658761380, now seen corresponding path program 1 times [2022-12-06 05:24:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:37,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288350685] [2022-12-06 05:24:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:38,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 05:24:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288350685] [2022-12-06 05:24:38,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288350685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:38,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:38,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723452848] [2022-12-06 05:24:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:38,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:38,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:38,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:38,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:38,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 05:24:38,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:38,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:38,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:38,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:38,307 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:38,314 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 05:24:38,321 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:38,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:38,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:38,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 05:24:38,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:38,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 05:24:38,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,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 05:24:38,353 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:38,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:38,353 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:38,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:38,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,378 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:38,378 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:24:38,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 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 05:24:38,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:38,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:38,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:24:38,524 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:38,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 05:24:38,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:38,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 05:24:38,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2022-12-06 05:24:38,524 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 05:24:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash -893395581, now seen corresponding path program 1 times [2022-12-06 05:24:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:38,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952339461] [2022-12-06 05:24:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:38,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 05:24:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952339461] [2022-12-06 05:24:38,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952339461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:38,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:38,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688783180] [2022-12-06 05:24:38,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:38,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:38,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:38,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:38,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:38,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:38,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:38,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:38,869 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:38,869 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:38,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:38,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:38,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:38,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 05:24:38,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:38,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 05:24:38,916 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,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 05:24:38,917 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:38,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:38,917 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:38,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:38,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,941 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:38,942 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:24:38,943 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 05:24:38,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:38,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:39,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:39,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:24:39,091 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:39,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 05:24:39,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:39,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 05:24:39,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2022-12-06 05:24:39,091 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 05:24:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:39,092 INFO L85 PathProgramCache]: Analyzing trace with hash 849414754, now seen corresponding path program 1 times [2022-12-06 05:24:39,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:39,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206734402] [2022-12-06 05:24:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:39,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 05:24:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:39,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206734402] [2022-12-06 05:24:39,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206734402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:39,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:39,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876501380] [2022-12-06 05:24:39,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:39,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:39,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:39,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 05:24:39,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:39,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:39,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:39,428 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:39,428 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:24:39,435 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 05:24:39,443 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:39,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:39,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:39,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 05:24:39,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:39,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:39,477 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:39,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 05:24:39,477 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:39,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:39,478 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:39,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:39,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:39,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:39,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:39,502 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:39,502 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:39,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 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 05:24:39,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:39,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:39,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:39,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:24:39,650 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:39,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 05:24:39,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:39,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 05:24:39,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2022-12-06 05:24:39,650 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 05:24:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1702742207, now seen corresponding path program 1 times [2022-12-06 05:24:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:39,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146576123] [2022-12-06 05:24:39,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:39,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146576123] [2022-12-06 05:24:39,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146576123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:39,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:39,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769483424] [2022-12-06 05:24:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:39,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:39,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:39,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:39,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 05:24:39,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:39,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:39,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:39,997 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:39,997 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:40,005 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 05:24:40,013 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:40,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:40,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:40,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 05:24:40,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:40,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 05:24:40,046 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,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 05:24:40,047 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:40,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:40,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:40,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:40,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,071 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:40,071 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:40,072 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 05:24:40,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:40,224 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:40,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:40,225 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:40,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:40,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:40,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2022-12-06 05:24:40,225 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 05:24:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash 40068128, now seen corresponding path program 1 times [2022-12-06 05:24:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:40,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741187754] [2022-12-06 05:24:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:40,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 05:24:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:40,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741187754] [2022-12-06 05:24:40,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741187754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:40,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:40,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562092890] [2022-12-06 05:24:40,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:40,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:40,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:40,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 05:24:40,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:40,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:40,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:40,551 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:40,551 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:40,558 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 05:24:40,565 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:40,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:40,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:40,566 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:40,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 05:24:40,598 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:40,598 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:40,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:40,598 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:40,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:40,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,623 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:40,623 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:24:40,624 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 05:24:40,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:40,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:40,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:40,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:24:40,769 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:40,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 05:24:40,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:40,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 05:24:40,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2022-12-06 05:24:40,769 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 05:24:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1782878463, now seen corresponding path program 1 times [2022-12-06 05:24:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:40,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744755250] [2022-12-06 05:24:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:40,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 05:24:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:40,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744755250] [2022-12-06 05:24:40,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744755250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:40,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939591517] [2022-12-06 05:24:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:40,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:40,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:40,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:40,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 05:24:40,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:40,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:40,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:41,119 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:41,119 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:41,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 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 05:24:41,131 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:41,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:41,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:41,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 05:24:41,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:41,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:41,162 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:41,162 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:41,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:41,162 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:41,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:41,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,187 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:41,188 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:24:41,189 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 05:24:41,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:41,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:41,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:41,338 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:41,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 05:24:41,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:41,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 05:24:41,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2022-12-06 05:24:41,338 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 05:24:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -769278498, now seen corresponding path program 1 times [2022-12-06 05:24:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:41,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036438956] [2022-12-06 05:24:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:41,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 05:24:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:41,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036438956] [2022-12-06 05:24:41,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036438956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:41,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:41,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:41,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862027667] [2022-12-06 05:24:41,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:41,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:41,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:41,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:41,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:41,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 05:24:41,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:41,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:41,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:41,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:41,666 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:41,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 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 05:24:41,681 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:41,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:41,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:41,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 05:24:41,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:41,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 05:24:41,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:41,715 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:41,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:41,715 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:41,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:41,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,740 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:41,740 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:41,741 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 05:24:41,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:41,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:41,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:41,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:24:41,884 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:41,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 05:24:41,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:41,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 05:24:41,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2022-12-06 05:24:41,884 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 05:24:41,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 973531837, now seen corresponding path program 1 times [2022-12-06 05:24:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:41,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630970910] [2022-12-06 05:24:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:41,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630970910] [2022-12-06 05:24:41,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630970910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:41,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:41,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938302251] [2022-12-06 05:24:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:41,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:41,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:41,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:41,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:41,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:41,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:41,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:42,218 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:42,219 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:24:42,225 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 05:24:42,232 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:42,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:42,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:42,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 05:24:42,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:42,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 05:24:42,266 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:42,266 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:42,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:42,266 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:42,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:42,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,291 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:42,291 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:24:42,292 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 05:24:42,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:42,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:42,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:24:42,441 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:42,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 05:24:42,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:42,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 05:24:42,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2022-12-06 05:24:42,441 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 05:24:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1578625124, now seen corresponding path program 1 times [2022-12-06 05:24:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:42,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172012763] [2022-12-06 05:24:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:42,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 05:24:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:42,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172012763] [2022-12-06 05:24:42,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172012763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:42,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:42,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:42,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971995615] [2022-12-06 05:24:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:42,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:42,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:42,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 05:24:42,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:42,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:42,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:42,819 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:42,819 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:42,826 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 05:24:42,833 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:42,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:42,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:42,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:42,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 05:24:42,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:42,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 05:24:42,864 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,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 05:24:42,865 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:42,865 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:42,865 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:42,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:42,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,889 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:42,890 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:42,891 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 05:24:42,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:42,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:43,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:43,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:24:43,036 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:43,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 05:24:43,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:43,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 05:24:43,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2022-12-06 05:24:43,036 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 05:24:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash 164185211, now seen corresponding path program 1 times [2022-12-06 05:24:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:43,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914107681] [2022-12-06 05:24:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:43,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 05:24:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914107681] [2022-12-06 05:24:43,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914107681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:43,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:43,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013475776] [2022-12-06 05:24:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:43,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:43,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:43,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:43,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:43,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 05:24:43,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:43,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:43,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:43,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:43,384 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:24:43,390 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 05:24:43,398 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:43,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:43,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:43,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 05:24:43,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:43,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 05:24:43,431 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,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 05:24:43,431 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:43,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:43,431 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:43,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:43,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,456 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:43,456 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:24:43,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 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 05:24:43,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:43,596 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:43,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:24:43,597 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:43,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 05:24:43,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:43,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 05:24:43,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2022-12-06 05:24:43,597 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 05:24:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1906995546, now seen corresponding path program 1 times [2022-12-06 05:24:43,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281814841] [2022-12-06 05:24:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:43,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 05:24:43,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:43,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281814841] [2022-12-06 05:24:43,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281814841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:43,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:43,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365757921] [2022-12-06 05:24:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:43,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:43,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:43,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:43,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 05:24:43,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:43,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:43,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:43,929 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:43,929 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:43,936 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 05:24:43,944 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:43,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:43,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:43,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 05:24:43,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:43,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 05:24:43,978 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,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 05:24:43,978 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:43,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:43,978 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:43,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:43,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:43,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,003 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:44,003 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:24:44,004 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 05:24:44,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:44,155 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:44,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:44,156 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:44,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 05:24:44,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:44,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 05:24:44,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2022-12-06 05:24:44,156 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 05:24:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -645161415, now seen corresponding path program 1 times [2022-12-06 05:24:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:44,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696643567] [2022-12-06 05:24:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:44,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696643567] [2022-12-06 05:24:44,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696643567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:44,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:44,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:44,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252859566] [2022-12-06 05:24:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:44,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:44,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:44,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 05:24:44,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:44,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:44,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:44,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:44,502 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:44,509 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 05:24:44,516 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:44,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:44,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:44,517 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:44,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:44,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 05:24:44,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,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 05:24:44,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:44,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:44,549 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:44,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:44,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,574 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:44,574 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:44,575 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 05:24:44,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:44,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:44,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:44,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:24:44,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:44,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 05:24:44,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:44,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 05:24:44,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2022-12-06 05:24:44,732 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 05:24:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1097648920, now seen corresponding path program 1 times [2022-12-06 05:24:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:44,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849373884] [2022-12-06 05:24:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:44,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 05:24:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:44,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849373884] [2022-12-06 05:24:44,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849373884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:44,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:44,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183147713] [2022-12-06 05:24:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:44,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:44,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:44,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:44,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 05:24:44,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:44,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:44,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:45,082 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:45,082 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:45,089 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 05:24:45,097 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:45,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:45,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:45,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:45,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 05:24:45,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:45,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 05:24:45,131 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,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 05:24:45,131 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:45,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:45,131 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:45,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:45,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,156 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:45,156 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:24:45,157 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 05:24:45,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:45,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:45,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:24:45,317 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:45,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 05:24:45,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:45,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 05:24:45,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2022-12-06 05:24:45,317 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 05:24:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1454508041, now seen corresponding path program 1 times [2022-12-06 05:24:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:45,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618766102] [2022-12-06 05:24:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:45,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618766102] [2022-12-06 05:24:45,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618766102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:45,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:45,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999702736] [2022-12-06 05:24:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:45,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:45,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:45,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:45,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:45,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:45,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:45,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:45,691 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:45,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 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 05:24:45,703 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:45,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:45,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:45,703 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:45,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:45,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 05:24:45,734 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,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 05:24:45,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:45,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:45,734 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:45,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:45,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,759 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:45,759 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:24:45,760 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 05:24:45,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:45,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:45,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:45,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:24:45,917 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:45,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 05:24:45,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:45,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 05:24:45,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2022-12-06 05:24:45,917 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 05:24:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 288302294, now seen corresponding path program 1 times [2022-12-06 05:24:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:45,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161450064] [2022-12-06 05:24:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:45,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 05:24:45,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161450064] [2022-12-06 05:24:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161450064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:45,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686474401] [2022-12-06 05:24:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:45,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:45,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:45,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 05:24:45,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:45,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:45,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:46,255 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:46,255 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:46,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:46,269 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:46,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:46,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:46,270 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:46,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:46,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 05:24:46,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,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 05:24:46,301 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:46,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:46,301 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:46,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:46,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,326 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:46,326 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:46,327 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 05:24:46,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:46,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:46,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:24:46,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:46,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 05:24:46,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:46,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 05:24:46,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2022-12-06 05:24:46,482 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 05:24:46,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2031112629, now seen corresponding path program 1 times [2022-12-06 05:24:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:46,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594608212] [2022-12-06 05:24:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:46,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 05:24:46,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594608212] [2022-12-06 05:24:46,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594608212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:46,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:46,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983298710] [2022-12-06 05:24:46,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:46,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:46,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:46,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:46,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:46,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 05:24:46,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:46,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:46,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:46,809 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:46,809 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:46,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 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 05:24:46,823 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:46,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:46,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:46,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 05:24:46,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:46,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:46,857 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:46,858 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:46,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:46,858 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:46,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:46,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,882 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:46,883 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:24:46,884 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 05:24:46,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:46,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:47,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:47,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:24:47,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:47,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 05:24:47,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:47,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 05:24:47,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2022-12-06 05:24:47,028 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 05:24:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash -521044332, now seen corresponding path program 1 times [2022-12-06 05:24:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:47,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91321299] [2022-12-06 05:24:47,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:47,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91321299] [2022-12-06 05:24:47,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91321299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:47,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:47,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615270670] [2022-12-06 05:24:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:47,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:47,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:47,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:47,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 05:24:47,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:47,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:47,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:47,381 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:47,381 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:47,388 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 05:24:47,395 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:47,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:47,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:47,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 05:24:47,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:47,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 05:24:47,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:47,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 05:24:47,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:47,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:47,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:47,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:47,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:47,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:47,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:47,454 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:47,455 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:24:47,456 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 05:24:47,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:47,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:47,609 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:47,610 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:24:47,610 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:47,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:47,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:47,610 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:47,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2022-12-06 05:24:47,610 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 05:24:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1221766003, now seen corresponding path program 1 times [2022-12-06 05:24:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:47,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35560683] [2022-12-06 05:24:47,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:47,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 05:24:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:47,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35560683] [2022-12-06 05:24:47,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35560683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:47,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:47,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292203390] [2022-12-06 05:24:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:47,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:47,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:47,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:47,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 05:24:47,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:47,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:47,951 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:47,951 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:47,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:47,965 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:47,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:47,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:47,966 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:47,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:47,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:47,999 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:47,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:47,999 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:47,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:47,999 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:48,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:48,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,024 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:48,025 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:24:48,026 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 05:24:48,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:48,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:48,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:24:48,171 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:48,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:48,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:48,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:48,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2022-12-06 05:24:48,171 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 05:24:48,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1330390958, now seen corresponding path program 1 times [2022-12-06 05:24:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:48,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536082477] [2022-12-06 05:24:48,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:48,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 05:24:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:48,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536082477] [2022-12-06 05:24:48,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536082477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:48,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:48,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973821549] [2022-12-06 05:24:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:48,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:48,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:48,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 05:24:48,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:48,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:48,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:48,513 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:48,513 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:48,521 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 05:24:48,528 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:48,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:48,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:48,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 05:24:48,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:48,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:48,561 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,561 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:48,562 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:48,562 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:48,562 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:48,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:48,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,596 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:48,596 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:48,597 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 05:24:48,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:48,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:48,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:48,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:24:48,750 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:48,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 05:24:48,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:48,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:48,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2022-12-06 05:24:48,751 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 05:24:48,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 412419377, now seen corresponding path program 1 times [2022-12-06 05:24:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:48,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390712043] [2022-12-06 05:24:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:48,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 05:24:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:48,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390712043] [2022-12-06 05:24:48,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390712043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:48,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:48,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74772645] [2022-12-06 05:24:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:48,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:48,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:48,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:48,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 05:24:48,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:48,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:49,089 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:49,089 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:49,097 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 05:24:49,105 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:49,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:49,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:49,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 05:24:49,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:49,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 05:24:49,140 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,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 05:24:49,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:49,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:49,141 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:49,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:49,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,166 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:49,166 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:24:49,167 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 05:24:49,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:49,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:49,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:24:49,330 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:49,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:49,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:49,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:49,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2022-12-06 05:24:49,330 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 05:24:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2139737584, now seen corresponding path program 1 times [2022-12-06 05:24:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17837285] [2022-12-06 05:24:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:49,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 05:24:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:49,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17837285] [2022-12-06 05:24:49,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17837285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:49,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:49,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145210368] [2022-12-06 05:24:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:49,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:49,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:49,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:49,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:49,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:49,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:49,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:49,667 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:49,673 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 05:24:49,681 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:49,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:49,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:49,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 05:24:49,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:49,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 05:24:49,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,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 05:24:49,714 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:49,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:49,715 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:49,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:49,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,739 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:49,740 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:24:49,741 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 05:24:49,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:49,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:49,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:49,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:24:49,884 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:49,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 05:24:49,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:49,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 05:24:49,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2022-12-06 05:24:49,884 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 05:24:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash -396927249, now seen corresponding path program 1 times [2022-12-06 05:24:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:49,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439353638] [2022-12-06 05:24:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:49,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 05:24:49,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:49,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439353638] [2022-12-06 05:24:49,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439353638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:49,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:49,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:49,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307853920] [2022-12-06 05:24:49,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:49,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:49,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:49,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 05:24:49,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:49,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:49,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:50,244 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:50,244 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:24:50,251 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 05:24:50,257 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:50,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:50,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:50,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 05:24:50,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:50,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 05:24:50,288 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,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 05:24:50,289 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:50,289 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:50,289 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:50,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:50,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,313 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:50,314 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:50,315 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 05:24:50,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:50,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:50,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:24:50,469 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:50,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 05:24:50,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:50,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 05:24:50,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2022-12-06 05:24:50,469 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 05:24:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1345883086, now seen corresponding path program 1 times [2022-12-06 05:24:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:50,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722325382] [2022-12-06 05:24:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:50,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 05:24:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:50,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722325382] [2022-12-06 05:24:50,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722325382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:50,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:50,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226203474] [2022-12-06 05:24:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:50,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:50,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:50,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:50,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 05:24:50,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:50,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:50,816 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:50,816 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:50,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 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 05:24:50,830 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:50,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:50,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:50,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:50,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 05:24:50,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:50,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:50,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24: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 05:24:50,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:50,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:50,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:50,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:50,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,897 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:50,897 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:24:50,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 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 05:24:50,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:50,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:51,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:51,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:24:51,055 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:51,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 05:24:51,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:51,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 05:24:51,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2022-12-06 05:24:51,055 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 05:24:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1206273875, now seen corresponding path program 1 times [2022-12-06 05:24:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:51,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492697716] [2022-12-06 05:24:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:51,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 05:24:51,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:51,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492697716] [2022-12-06 05:24:51,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492697716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:51,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:51,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579018743] [2022-12-06 05:24:51,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:51,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:51,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:51,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:51,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 05:24:51,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:51,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:51,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:51,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:51,417 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:24:51,424 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 05:24:51,432 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:51,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:51,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:51,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 05:24:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:51,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 05:24:51,466 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:51,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 05:24:51,466 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:51,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:51,467 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:51,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:51,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:51,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:51,491 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:51,492 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:51,493 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 05:24:51,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:51,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:51,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:51,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:24:51,637 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:51,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 05:24:51,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:51,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 05:24:51,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2022-12-06 05:24:51,637 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 05:24:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 536536460, now seen corresponding path program 1 times [2022-12-06 05:24:51,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:51,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19894093] [2022-12-06 05:24:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:51,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 05:24:51,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19894093] [2022-12-06 05:24:51,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19894093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:51,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:51,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198511453] [2022-12-06 05:24:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:51,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:51,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:51,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:51,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 05:24:51,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:51,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:51,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:51,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:51,973 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:51,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 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 05:24:51,987 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:51,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:51,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:51,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 05:24:51,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:52,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 05:24:52,020 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,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 05:24:52,020 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:52,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:52,020 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:52,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:52,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,049 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:52,049 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:52,050 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 05:24:52,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:52,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:52,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:24:52,216 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:52,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:52,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:52,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:52,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2022-12-06 05:24:52,216 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 05:24:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2015620501, now seen corresponding path program 1 times [2022-12-06 05:24:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:52,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760104950] [2022-12-06 05:24:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:52,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760104950] [2022-12-06 05:24:52,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760104950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:52,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:52,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332974198] [2022-12-06 05:24:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:52,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:52,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:52,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:52,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:52,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:52,565 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:52,565 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:24:52,574 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 05:24:52,582 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:52,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:52,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:52,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 05:24:52,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:52,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:52,616 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,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 05:24:52,617 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:52,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:52,617 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:52,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:52,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,644 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:52,644 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:24:52,645 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 05:24:52,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:52,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:52,794 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:52,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:24:52,794 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:52,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:52,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:52,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:52,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2022-12-06 05:24:52,795 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 05:24:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash -272810166, now seen corresponding path program 1 times [2022-12-06 05:24:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:52,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360194445] [2022-12-06 05:24:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24: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 05:24:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:52,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360194445] [2022-12-06 05:24:52,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360194445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:52,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:52,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892638406] [2022-12-06 05:24:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:52,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:52,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24: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 05:24:52,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:52,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:52,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:53,182 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:53,182 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:53,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:53,196 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:53,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:53,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:53,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 05:24:53,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:53,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:53,230 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:53,230 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:53,231 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:53,231 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:53,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:53,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,262 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:53,262 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:24:53,263 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 05:24:53,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:53,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:53,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:24:53,406 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:53,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 05:24:53,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:53,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 05:24:53,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2022-12-06 05:24:53,406 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 05:24:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1470000169, now seen corresponding path program 1 times [2022-12-06 05:24:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:53,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115576524] [2022-12-06 05:24:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:53,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 05:24:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:53,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115576524] [2022-12-06 05:24:53,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115576524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:53,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:53,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686966282] [2022-12-06 05:24:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:53,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:53,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:53,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:53,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:53,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:53,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 05:24:53,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:53,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:53,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:53,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:53,749 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:53,756 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 05:24:53,763 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:53,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:53,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24: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 05:24:53,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:53,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 05:24:53,801 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,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 05:24:53,801 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:53,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:53,801 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:53,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:53,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,826 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:53,826 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:53,827 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 05:24:53,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:53,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:53,978 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:53,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:24:53,978 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:53,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 05:24:53,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:53,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 05:24:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2022-12-06 05:24:53,978 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 05:24:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1082156792, now seen corresponding path program 1 times [2022-12-06 05:24:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:53,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904700502] [2022-12-06 05:24:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:53,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:54,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 05:24:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:54,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904700502] [2022-12-06 05:24:54,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904700502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:54,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:54,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252449250] [2022-12-06 05:24:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:54,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:54,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 05:24:54,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:54,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:54,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:54,319 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:54,319 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:54,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:54,334 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:54,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:54,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:54,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 05:24:54,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:54,369 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,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 05:24:54,369 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:54,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:54,369 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:54,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:54,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,394 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:54,394 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:24:54,395 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 05:24:54,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:54,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:54,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:24:54,536 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:54,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:54,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:54,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:54,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2022-12-06 05:24:54,536 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 05:24:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 660653543, now seen corresponding path program 1 times [2022-12-06 05:24:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:54,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912487215] [2022-12-06 05:24:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:54,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912487215] [2022-12-06 05:24:54,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912487215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:54,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:54,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381035797] [2022-12-06 05:24:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:54,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:54,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:54,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:54,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:54,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:54,887 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:54,887 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:24:54,893 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 05:24:54,900 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:54,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:54,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:54,900 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:54,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:54,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:54,931 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:54,931 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:54,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:54,931 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:54,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:54,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,955 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:54,956 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:54,957 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 05:24:54,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:54,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:55,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:55,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:24:55,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:55,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 05:24:55,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:55,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 05:24:55,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2022-12-06 05:24:55,105 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 05:24:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1891503418, now seen corresponding path program 1 times [2022-12-06 05:24:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:55,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527561076] [2022-12-06 05:24:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:55,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527561076] [2022-12-06 05:24:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527561076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:55,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:55,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:55,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309378876] [2022-12-06 05:24:55,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:55,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:55,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:55,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:55,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:55,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:55,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:55,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:55,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:55,433 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:55,433 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:24:55,440 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 05:24:55,447 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:55,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:55,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:55,448 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:55,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:55,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:55,482 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:55,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:55,482 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:55,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:55,482 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:55,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:55,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:55,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:55,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:55,507 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:55,507 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:24:55,508 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 05:24:55,510 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:55,510 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:55,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:55,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:24:55,662 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:55,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 05:24:55,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:55,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 05:24:55,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2022-12-06 05:24:55,662 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 05:24:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash -148693083, now seen corresponding path program 1 times [2022-12-06 05:24:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:55,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761789124] [2022-12-06 05:24:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:55,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 05:24:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:55,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761789124] [2022-12-06 05:24:55,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761789124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:55,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:55,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240621921] [2022-12-06 05:24:55,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:55,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:55,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:55,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:55,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:55,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:55,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 05:24:55,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:55,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:55,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:55,991 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:55,991 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:55,998 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 05:24:56,006 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:56,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:56,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:56,006 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:56,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:56,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 05:24:56,039 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,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 05:24:56,039 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:56,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:56,039 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:56,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:56,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,064 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:56,064 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:24:56,065 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 05:24:56,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:56,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:56,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:24:56,220 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:56,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 05:24:56,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:56,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 05:24:56,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2022-12-06 05:24:56,220 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 05:24:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1594117252, now seen corresponding path program 1 times [2022-12-06 05:24:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762420065] [2022-12-06 05:24:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:56,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 05:24:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:56,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762420065] [2022-12-06 05:24:56,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762420065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:56,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:56,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796983631] [2022-12-06 05:24:56,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:56,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:56,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:56,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:56,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 05:24:56,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:56,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:56,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:56,564 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:56,564 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:56,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 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 05:24:56,578 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:56,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:56,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:56,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 05:24:56,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:56,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 05:24:56,611 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:56,611 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:56,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:56,611 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:56,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:56,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,637 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:56,638 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:24:56,639 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 05:24:56,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:56,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:56,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:56,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:24:56,799 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:56,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:56,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:56,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:56,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2022-12-06 05:24:56,799 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 05:24:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash -958039709, now seen corresponding path program 1 times [2022-12-06 05:24:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415735888] [2022-12-06 05:24:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415735888] [2022-12-06 05:24:56,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415735888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:56,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:56,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743881735] [2022-12-06 05:24:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:56,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:56,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:56,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:56,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:56,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:56,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:56,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:57,136 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:57,136 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:57,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:24:57,150 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:57,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:57,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:57,151 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:57,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:57,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 05:24:57,185 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,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 05:24:57,185 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:57,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:57,185 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:57,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:57,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,210 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:57,210 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:24:57,211 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 05:24:57,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:57,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:57,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:24:57,360 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:57,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:57,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:57,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:57,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2022-12-06 05:24:57,360 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 05:24:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash 784770626, now seen corresponding path program 1 times [2022-12-06 05:24:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:57,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129520795] [2022-12-06 05:24:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:57,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 05:24:57,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:57,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129520795] [2022-12-06 05:24:57,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129520795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:57,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:57,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146208104] [2022-12-06 05:24:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:57,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:57,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:57,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 05:24:57,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:57,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:57,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:57,727 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:57,728 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:24:57,733 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 05:24:57,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:57,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:57,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:57,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 05:24:57,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:57,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:57,769 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:24:57,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:57,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:57,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:57,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:57,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,794 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:57,794 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:24:57,795 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 05:24:57,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:57,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:57,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:57,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:57,947 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:57,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 05:24:57,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:57,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 05:24:57,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2022-12-06 05:24:57,948 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 05:24:57,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1767386335, now seen corresponding path program 1 times [2022-12-06 05:24:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:57,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862379730] [2022-12-06 05:24:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:58,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 05:24:58,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:58,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862379730] [2022-12-06 05:24:58,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862379730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:58,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:58,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:58,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621910953] [2022-12-06 05:24:58,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:58,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:58,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:58,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:58,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 05:24:58,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:58,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:58,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:58,294 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:58,295 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:24:58,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 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 05:24:58,309 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:58,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:58,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:58,309 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:58,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:58,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:24:58,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,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 05:24:58,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:58,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:58,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,344 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:58,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:58,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,368 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:24:58,368 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:24:58,369 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 05:24:58,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:58,516 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:58,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:24:58,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:58,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 05:24:58,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:58,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 05:24:58,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2022-12-06 05:24:58,516 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 05:24:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash -24576000, now seen corresponding path program 1 times [2022-12-06 05:24:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:58,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115094741] [2022-12-06 05:24:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:58,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:58,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 05:24:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115094741] [2022-12-06 05:24:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115094741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:58,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:58,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135444314] [2022-12-06 05:24:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:58,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:58,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:58,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 05:24:58,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:58,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:58,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:58,869 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:58,869 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:24:58,876 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 05:24:58,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:58,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:58,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:58,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:58,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 05:24:58,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:58,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 05:24:58,922 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,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 05:24:58,923 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:58,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:58,923 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:58,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:58,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,952 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:58,952 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:24:58,953 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 05:24:58,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:58,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:59,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:59,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:24:59,101 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:59,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 05:24:59,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:59,102 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:59,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2022-12-06 05:24:59,102 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 05:24:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1718234335, now seen corresponding path program 1 times [2022-12-06 05:24:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:59,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763926972] [2022-12-06 05:24:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:59,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 05:24:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:59,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763926972] [2022-12-06 05:24:59,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763926972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:59,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:59,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916260404] [2022-12-06 05:24:59,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:59,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:59,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:59,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 05:24:59,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:59,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:59,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:59,452 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:24:59,453 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:24:59,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:24:59,466 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:24:59,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:24:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:24:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:24:59,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:24:59,467 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:24:59,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:24:59,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 05:24:59,498 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:59,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 05:24:59,498 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:24:59,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:59,498 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:59,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:59,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:59,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:59,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:59,523 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:24:59,523 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:24:59,524 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 05:24:59,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:24:59,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:24:59,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:59,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:24:59,684 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:24:59,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 05:24:59,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:59,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 05:24:59,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2022-12-06 05:24:59,684 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 05:24:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -833922626, now seen corresponding path program 1 times [2022-12-06 05:24:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984445119] [2022-12-06 05:24:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:59,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 05:24:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984445119] [2022-12-06 05:24:59,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984445119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:59,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:59,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:24:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068301568] [2022-12-06 05:24:59,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:59,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:24:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:59,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:24:59,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:24:59,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:24:59,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 05:24:59,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:59,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:24:59,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:00,034 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:00,034 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:00,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 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 05:25:00,049 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:00,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:00,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:00,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:00,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 05:25:00,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:00,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:00,082 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,082 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:00,082 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:00,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:00,082 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:00,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:00,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,107 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:00,107 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:00,108 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 05:25:00,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:00,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:00,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:25:00,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:00,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 05:25:00,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:00,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 05:25:00,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2022-12-06 05:25:00,273 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 05:25:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash 908887709, now seen corresponding path program 1 times [2022-12-06 05:25:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:00,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265455804] [2022-12-06 05:25:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265455804] [2022-12-06 05:25:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265455804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:00,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:00,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011378551] [2022-12-06 05:25:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:00,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:00,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:00,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 05:25:00,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:00,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:00,609 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:00,610 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:00,616 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 05:25:00,624 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:00,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:00,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:00,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 05:25:00,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:00,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 05:25:00,658 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,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 05:25:00,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:00,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:00,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:00,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:00,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,683 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:00,683 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:25:00,684 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 05:25:00,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:00,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:00,851 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:00,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:25:00,852 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:00,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 05:25:00,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:00,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 05:25:00,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2022-12-06 05:25:00,852 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 05:25:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1643269252, now seen corresponding path program 1 times [2022-12-06 05:25:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:00,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114579430] [2022-12-06 05:25:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114579430] [2022-12-06 05:25:00,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114579430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:00,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:00,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763532388] [2022-12-06 05:25:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:00,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:00,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:00,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 05:25:00,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:00,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:00,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:01,188 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:01,188 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:01,195 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 05:25:01,202 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:01,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:01,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:01,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 05:25:01,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:01,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 05:25:01,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,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 05:25:01,233 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:01,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:01,233 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:01,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:01,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,258 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:01,258 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:25:01,259 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 05:25:01,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:01,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:01,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:25:01,397 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:01,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:01,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:01,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:01,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2022-12-06 05:25:01,397 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 05:25:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:01,398 INFO L85 PathProgramCache]: Analyzing trace with hash 99541083, now seen corresponding path program 1 times [2022-12-06 05:25:01,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:01,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307920473] [2022-12-06 05:25:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:01,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 05:25:01,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:01,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307920473] [2022-12-06 05:25:01,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307920473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:01,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:01,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819395742] [2022-12-06 05:25:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:01,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:01,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:01,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 05:25:01,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:01,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:01,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:01,751 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:01,752 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:01,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 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 05:25:01,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:01,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:01,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:01,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 05:25:01,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:01,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 05:25:01,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,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 05:25:01,805 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:01,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:01,805 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:01,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:01,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,830 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:01,830 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:01,831 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 05:25:01,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:01,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:01,980 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:01,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:25:01,980 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:01,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 05:25:01,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:01,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 05:25:01,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2022-12-06 05:25:01,981 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 05:25:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1842351418, now seen corresponding path program 1 times [2022-12-06 05:25:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:01,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373852116] [2022-12-06 05:25:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:02,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 05:25:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:02,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373852116] [2022-12-06 05:25:02,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373852116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:02,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:02,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971638308] [2022-12-06 05:25:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:02,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:02,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:02,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:02,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 05:25:02,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:02,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:02,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:02,334 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:02,334 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:02,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:02,346 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:02,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:02,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:02,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 05:25:02,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:02,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 05:25:02,377 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:02,377 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:02,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:02,377 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:02,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:02,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,402 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:02,402 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:25:02,403 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 05:25:02,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:02,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:02,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:25:02,558 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:02,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 05:25:02,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:02,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:02,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2022-12-06 05:25:02,559 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 05:25:02,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -709805543, now seen corresponding path program 1 times [2022-12-06 05:25:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:02,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635155396] [2022-12-06 05:25:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:02,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:02,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635155396] [2022-12-06 05:25:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635155396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:02,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:02,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257902310] [2022-12-06 05:25:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:02,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:02,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:02,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 05:25:02,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:02,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:02,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:02,898 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:02,898 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:02,905 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 05:25:02,912 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:02,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:02,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:02,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 05:25:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:02,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 05:25:02,945 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,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 05:25:02,945 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:02,945 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:02,945 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:02,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:02,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,975 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:02,976 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:25:02,977 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 05:25:02,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:02,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:03,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:03,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:25:03,131 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:03,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 05:25:03,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:03,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 05:25:03,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2022-12-06 05:25:03,132 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 05:25:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1033004792, now seen corresponding path program 1 times [2022-12-06 05:25:03,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:03,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197868487] [2022-12-06 05:25:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:03,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 05:25:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197868487] [2022-12-06 05:25:03,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197868487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:03,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:03,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027945187] [2022-12-06 05:25:03,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:03,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:03,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:03,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:03,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 05:25:03,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:03,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:03,474 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:03,475 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:25:03,482 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 05:25:03,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:03,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:03,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:03,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 05:25:03,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:03,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 05:25:03,521 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:03,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 05:25:03,521 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:03,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:03,521 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:03,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:03,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:03,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:03,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:03,546 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:03,546 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:25:03,547 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 05:25:03,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:03,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:03,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:03,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:25:03,704 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:03,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 05:25:03,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:03,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2022-12-06 05:25:03,704 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 05:25:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1519152169, now seen corresponding path program 1 times [2022-12-06 05:25:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:03,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404469809] [2022-12-06 05:25:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:03,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:03,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404469809] [2022-12-06 05:25:03,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404469809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:03,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:03,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439804932] [2022-12-06 05:25:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:03,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:03,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:03,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:03,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:03,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:03,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:04,039 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:04,039 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:04,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:04,054 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:04,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:04,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:04,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 05:25:04,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:04,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 05:25:04,090 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,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 05:25:04,090 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:04,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:04,090 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:04,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:04,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,117 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:04,117 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:04,119 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 05:25:04,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:04,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:04,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 05:25:04,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:04,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 05:25:04,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:04,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 05:25:04,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2022-12-06 05:25:04,297 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 05:25:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 223658166, now seen corresponding path program 1 times [2022-12-06 05:25:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:04,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284104031] [2022-12-06 05:25:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:04,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 05:25:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:04,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284104031] [2022-12-06 05:25:04,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284104031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:04,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:04,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405080078] [2022-12-06 05:25:04,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:04,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:04,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:04,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:04,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 05:25:04,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:04,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:04,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:04,641 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:04,641 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:04,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 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 05:25:04,655 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:04,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:04,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:04,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 05:25:04,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:04,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:04,688 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:04,688 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:04,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:04,688 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:04,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:04,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,713 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:04,713 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:04,714 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 05:25:04,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:04,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:04,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:04,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:25:04,862 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:04,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 05:25:04,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:04,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 05:25:04,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2022-12-06 05:25:04,862 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 05:25:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1966468501, now seen corresponding path program 1 times [2022-12-06 05:25:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:04,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300144684] [2022-12-06 05:25:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:04,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 05:25:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:04,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300144684] [2022-12-06 05:25:04,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300144684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:04,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:04,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544895455] [2022-12-06 05:25:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:04,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:04,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:04,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:04,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:04,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 05:25:04,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:04,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:04,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:05,204 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:05,204 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:05,211 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 05:25:05,219 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:05,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:05,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:05,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 05:25:05,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:05,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 05:25:05,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,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 05:25:05,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:05,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:05,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:05,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:05,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,288 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:05,288 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:05,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 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 05:25:05,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:05,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:05,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:25:05,451 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:05,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:05,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:05,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:05,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2022-12-06 05:25:05,452 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 05:25:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -585688460, now seen corresponding path program 1 times [2022-12-06 05:25:05,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:05,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379486475] [2022-12-06 05:25:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25: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 05:25:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379486475] [2022-12-06 05:25:05,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379486475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:05,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:05,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548331811] [2022-12-06 05:25:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:05,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:05,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25: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 05:25:05,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:05,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:05,805 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:05,805 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:05,812 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 05:25:05,819 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:05,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:05,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:05,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 05:25:05,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:05,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 05:25:05,855 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,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 05:25:05,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:05,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:05,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:05,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:05,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,882 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:05,882 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:25:05,883 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 05:25:05,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:05,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:06,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:06,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:25:06,071 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:06,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 05:25:06,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:06,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 05:25:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2022-12-06 05:25:06,071 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 05:25:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1157121875, now seen corresponding path program 1 times [2022-12-06 05:25:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350708577] [2022-12-06 05:25:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:06,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:06,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350708577] [2022-12-06 05:25:06,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350708577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:06,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:06,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:06,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582739776] [2022-12-06 05:25:06,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:06,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:06,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:06,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:06,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:06,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:06,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:06,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:06,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:06,408 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:06,408 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:06,415 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 05:25:06,422 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:06,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:06,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:06,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 05:25:06,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:06,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 05:25:06,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:06,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 05:25:06,455 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:06,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:06,455 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:06,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:06,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:06,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:06,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:06,479 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:06,479 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:06,480 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 05:25:06,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:06,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:06,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:06,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:25:06,621 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:06,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 05:25:06,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:06,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 05:25:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2022-12-06 05:25:06,621 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 05:25:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:06,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1395035086, now seen corresponding path program 1 times [2022-12-06 05:25:06,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:06,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297597995] [2022-12-06 05:25:06,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:06,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:06,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 05:25:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297597995] [2022-12-06 05:25:06,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297597995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:06,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:06,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294170891] [2022-12-06 05:25:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:06,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:06,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:06,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:06,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 05:25:06,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:06,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:06,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:07,085 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:07,086 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:07,095 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 05:25:07,104 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:07,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:07,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:07,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:07,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 05:25:07,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:07,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 05:25:07,150 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,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 05:25:07,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:07,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:07,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:07,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:07,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,185 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:07,185 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:07,187 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 05:25:07,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:07,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:07,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:25:07,339 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:07,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 05:25:07,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:07,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 05:25:07,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2022-12-06 05:25:07,339 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 05:25:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash 347775249, now seen corresponding path program 1 times [2022-12-06 05:25:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:07,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164646451] [2022-12-06 05:25:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:07,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164646451] [2022-12-06 05:25:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164646451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:07,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248349491] [2022-12-06 05:25:07,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:07,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:07,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:07,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:07,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:07,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 05:25:07,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:07,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:07,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:07,689 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:07,689 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:07,696 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 05:25:07,703 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:07,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:07,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:07,704 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:07,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:07,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 05:25:07,738 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,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 05:25:07,738 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:07,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:07,738 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:07,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:07,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,763 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:07,763 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:07,764 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 05:25:07,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:07,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:07,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:07,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:25:07,915 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:07,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 05:25:07,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:07,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 05:25:07,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2022-12-06 05:25:07,915 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 05:25:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2090585584, now seen corresponding path program 1 times [2022-12-06 05:25:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:07,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422972090] [2022-12-06 05:25:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:07,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:07,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422972090] [2022-12-06 05:25:07,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422972090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:07,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:07,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080834691] [2022-12-06 05:25:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:07,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:07,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:07,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:07,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:07,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:07,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:07,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:08,234 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:08,234 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:08,240 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 05:25:08,248 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:08,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:08,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:08,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 05:25:08,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:08,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:08,281 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:08,281 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:08,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:08,281 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:08,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:08,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,306 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:08,306 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:25:08,307 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 05:25:08,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:08,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:08,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:08,450 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:08,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:08,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:08,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:08,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2022-12-06 05:25:08,450 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 05:25:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash -461571377, now seen corresponding path program 1 times [2022-12-06 05:25:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:08,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716331061] [2022-12-06 05:25:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:08,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:08,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716331061] [2022-12-06 05:25:08,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716331061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:08,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:08,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:08,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616006147] [2022-12-06 05:25:08,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:08,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:08,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:08,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:08,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:08,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:08,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:08,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:08,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:08,787 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:08,787 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:08,794 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 05:25:08,801 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:08,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:08,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:08,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 05:25:08,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:08,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:08,833 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:08,833 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:08,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:08,833 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,834 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:08,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:08,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,858 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:08,858 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:25:08,859 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 05:25:08,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:08,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:09,007 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:09,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:25:09,007 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:09,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 05:25:09,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:09,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 05:25:09,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2022-12-06 05:25:09,008 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 05:25:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1281238958, now seen corresponding path program 1 times [2022-12-06 05:25:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:09,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183574894] [2022-12-06 05:25:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:09,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:09,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183574894] [2022-12-06 05:25:09,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183574894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:09,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:09,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:09,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937456345] [2022-12-06 05:25:09,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:09,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:09,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:09,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 05:25:09,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:09,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:09,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:09,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:09,354 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:09,361 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 05:25:09,368 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:09,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:09,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:09,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 05:25:09,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:09,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:09,403 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:09,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:09,403 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:09,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:09,403 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:09,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:09,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:09,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:09,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:09,428 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:09,428 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:25:09,429 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 05:25:09,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:09,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:09,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:09,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:25:09,576 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:09,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 05:25:09,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:09,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 05:25:09,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2022-12-06 05:25:09,576 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 05:25:09,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1270918003, now seen corresponding path program 1 times [2022-12-06 05:25:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:09,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088916664] [2022-12-06 05:25:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:09,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 05:25:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:09,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088916664] [2022-12-06 05:25:09,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088916664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:09,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:09,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541094059] [2022-12-06 05:25:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:09,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:09,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:09,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:09,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 05:25:09,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:09,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:09,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:09,933 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:09,933 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:09,941 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 05:25:09,948 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:09,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:09,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:09,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 05:25:09,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:10,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 05:25:10,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,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 05:25:10,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:10,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:10,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:10,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:10,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,032 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:10,033 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:10,034 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 05:25:10,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:10,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:10,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:25:10,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:10,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 05:25:10,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:10,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 05:25:10,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2022-12-06 05:25:10,203 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 05:25:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 471892332, now seen corresponding path program 1 times [2022-12-06 05:25:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:10,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105037512] [2022-12-06 05:25:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:10,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 05:25:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:10,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105037512] [2022-12-06 05:25:10,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105037512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:10,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:10,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988059817] [2022-12-06 05:25:10,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:10,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:10,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:10,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 05:25:10,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:10,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:10,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:10,553 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:10,553 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:10,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:10,567 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:10,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:10,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:10,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 05:25:10,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:10,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 05:25:10,601 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:10,601 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:10,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:10,601 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:10,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:10,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,626 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:10,626 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:25:10,627 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 05:25:10,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:10,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:10,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:10,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:25:10,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:10,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 05:25:10,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:10,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 05:25:10,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2022-12-06 05:25:10,777 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 05:25:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2080264629, now seen corresponding path program 1 times [2022-12-06 05:25:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:10,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266161962] [2022-12-06 05:25:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:10,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266161962] [2022-12-06 05:25:10,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266161962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:10,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:10,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695187930] [2022-12-06 05:25:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:10,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:10,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:10,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:10,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:10,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:10,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:10,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:11,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:11,128 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:11,135 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 05:25:11,143 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:11,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:11,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:11,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:11,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:11,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 05:25:11,176 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,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 05:25:11,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:11,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:11,177 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:11,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:11,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,201 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:11,202 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:11,203 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 05:25:11,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:11,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:11,354 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:25:11,354 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:11,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 05:25:11,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:11,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 05:25:11,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2022-12-06 05:25:11,355 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 05:25:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash -337454294, now seen corresponding path program 1 times [2022-12-06 05:25:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:11,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166647872] [2022-12-06 05:25:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:11,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 05:25:11,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:11,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166647872] [2022-12-06 05:25:11,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166647872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:11,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:11,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527111796] [2022-12-06 05:25:11,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:11,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:11,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:11,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:11,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:11,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 05:25:11,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:11,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:11,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:11,727 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:11,727 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:11,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:11,742 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:11,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:11,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:11,743 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:11,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:11,774 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:11,774 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:11,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:11,775 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:11,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:11,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,799 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:11,800 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:11,801 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 05:25:11,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:11,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:11,942 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:11,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:25:11,943 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:11,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 05:25:11,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:11,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 05:25:11,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2022-12-06 05:25:11,943 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 05:25:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1405356041, now seen corresponding path program 1 times [2022-12-06 05:25:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:11,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554094683] [2022-12-06 05:25:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25: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 05:25:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554094683] [2022-12-06 05:25:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554094683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:12,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:12,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920380146] [2022-12-06 05:25:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:12,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:12,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25: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 05:25:12,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:12,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:12,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:12,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:12,293 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:12,299 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 05:25:12,306 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:12,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:12,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:12,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 05:25:12,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:12,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 05:25:12,339 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,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 05:25:12,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:12,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:12,339 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:12,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:12,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,364 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:12,364 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:12,365 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 05:25:12,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:12,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:12,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:25:12,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:12,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 05:25:12,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:12,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 05:25:12,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2022-12-06 05:25:12,524 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 05:25:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1146800920, now seen corresponding path program 1 times [2022-12-06 05:25:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013989599] [2022-12-06 05:25:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:12,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013989599] [2022-12-06 05:25:12,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013989599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:12,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:12,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899745168] [2022-12-06 05:25:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:12,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:12,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 05:25:12,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:12,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:12,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:12,869 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:12,869 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:12,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:12,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:12,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:12,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:12,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 05:25:12,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:12,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 05:25:12,916 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,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 05:25:12,916 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:12,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:12,916 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:12,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:12,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,941 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:12,941 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:25:12,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 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 05:25:12,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:12,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:13,098 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:13,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:25:13,098 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:13,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 05:25:13,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:13,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 05:25:13,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2022-12-06 05:25:13,099 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 05:25:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 596009415, now seen corresponding path program 1 times [2022-12-06 05:25:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:13,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208902156] [2022-12-06 05:25:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:13,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 05:25:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:13,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208902156] [2022-12-06 05:25:13,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208902156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:13,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:13,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856669755] [2022-12-06 05:25:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:13,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:13,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:13,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 05:25:13,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:13,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:13,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:13,440 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:13,441 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:13,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 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 05:25:13,454 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:13,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:13,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:13,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 05:25:13,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:13,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 05:25:13,492 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:13,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 05:25:13,492 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:13,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:13,493 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:13,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:13,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:13,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:13,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:13,520 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:25:13,521 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 05:25:13,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:13,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:13,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:13,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:25:13,667 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:13,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 05:25:13,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:13,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 05:25:13,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2022-12-06 05:25:13,668 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 05:25:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1956147546, now seen corresponding path program 1 times [2022-12-06 05:25:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:13,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155017359] [2022-12-06 05:25:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:13,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155017359] [2022-12-06 05:25:13,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155017359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:13,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:13,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244183790] [2022-12-06 05:25:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:13,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:13,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 05:25:13,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:13,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:13,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:14,001 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:14,002 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:14,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:14,016 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:14,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:14,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:14,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:14,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 05:25:14,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:14,048 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:14,049 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:14,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:14,049 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:14,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:14,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,073 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:14,074 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:14,075 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 05:25:14,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:14,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:14,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:25:14,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:14,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 05:25:14,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:14,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 05:25:14,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2022-12-06 05:25:14,236 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 05:25:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -213337211, now seen corresponding path program 1 times [2022-12-06 05:25:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:14,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952346610] [2022-12-06 05:25:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:14,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 05:25:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:14,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952346610] [2022-12-06 05:25:14,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952346610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:14,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:14,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:14,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794454007] [2022-12-06 05:25:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:14,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:14,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:14,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:14,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:14,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 05:25:14,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:14,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:14,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:14,588 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:14,589 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:14,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 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 05:25:14,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:14,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:14,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:14,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 05:25:14,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:14,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:14,631 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:14,632 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:14,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:14,632 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:14,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:14,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,656 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:14,657 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:25:14,658 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 05:25:14,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:14,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:14,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:14,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:14,801 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:14,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 05:25:14,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:14,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:14,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2022-12-06 05:25:14,801 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 05:25:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1529473124, now seen corresponding path program 1 times [2022-12-06 05:25:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:14,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356864302] [2022-12-06 05:25:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:14,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 05:25:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:14,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356864302] [2022-12-06 05:25:14,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356864302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:14,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:14,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294420157] [2022-12-06 05:25:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:14,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:14,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:14,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 05:25:14,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:14,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:14,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:15,151 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:15,151 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:15,158 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 05:25:15,165 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:15,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:15,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25: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 05:25:15,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:15,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 05:25:15,198 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,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 05:25:15,198 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:15,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:15,198 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:15,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:15,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,223 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:15,223 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 05:25:15,224 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 05:25:15,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:15,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:15,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:25:15,373 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:15,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 05:25:15,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:15,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:15,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2022-12-06 05:25:15,374 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 05:25:15,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1022683837, now seen corresponding path program 1 times [2022-12-06 05:25:15,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:15,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263417929] [2022-12-06 05:25:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:15,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:15,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 05:25:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:15,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263417929] [2022-12-06 05:25:15,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263417929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:15,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:15,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047336826] [2022-12-06 05:25:15,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:15,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:15,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:15,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:15,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 05:25:15,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:15,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:15,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:15,722 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:15,722 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:15,729 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 05:25:15,736 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:15,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:15,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:15,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 05:25:15,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:15,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:15,772 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:15,772 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:15,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:15,772 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:15,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:15,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,797 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:15,797 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:25:15,798 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 05:25:15,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:15,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:15,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:15,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:25:15,949 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:15,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:15,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:15,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 05:25:15,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2022-12-06 05:25:15,949 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 05:25:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 720126498, now seen corresponding path program 1 times [2022-12-06 05:25:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:15,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404150369] [2022-12-06 05:25:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:16,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 05:25:16,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:16,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404150369] [2022-12-06 05:25:16,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404150369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:16,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:16,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:16,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123374883] [2022-12-06 05:25:16,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:16,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:16,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:16,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:16,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 05:25:16,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:16,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:16,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:16,310 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:16,310 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:16,317 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 05:25:16,324 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:16,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:16,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:16,325 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:16,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:16,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:16,357 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,357 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:16,358 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:16,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:16,358 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,358 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:16,358 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:16,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,383 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:16,384 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:25:16,385 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 05:25:16,386 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,386 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:16,527 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:16,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:16,528 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:16,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 05:25:16,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:16,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 05:25:16,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2022-12-06 05:25:16,528 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 05:25:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1832030463, now seen corresponding path program 1 times [2022-12-06 05:25:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437558777] [2022-12-06 05:25:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:16,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 05:25:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:16,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437558777] [2022-12-06 05:25:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437558777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:16,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420763341] [2022-12-06 05:25:16,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:16,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:16,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:16,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 05:25:16,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:16,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:16,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:16,853 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:16,853 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:16,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:16,867 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:16,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:16,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:16,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 05:25:16,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:16,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:16,899 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,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 05:25:16,899 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:16,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:16,899 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:16,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:16,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,923 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:16,924 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:16,925 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 05:25:16,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:16,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:17,077 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:17,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:25:17,078 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:17,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 05:25:17,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:17,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 05:25:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2022-12-06 05:25:17,078 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 05:25:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -89220128, now seen corresponding path program 1 times [2022-12-06 05:25:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:17,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978415630] [2022-12-06 05:25:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:17,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 05:25:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:17,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978415630] [2022-12-06 05:25:17,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978415630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:17,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:17,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95538769] [2022-12-06 05:25:17,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:17,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:17,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:17,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:17,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:17,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 05:25:17,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:17,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:17,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:17,406 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:17,406 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:17,413 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 05:25:17,420 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:17,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:17,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:17,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 05:25:17,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:17,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 05:25:17,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:17,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 05:25:17,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:17,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:17,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:17,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:17,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:17,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:17,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:17,485 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:17,486 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:25:17,487 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 05:25:17,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:17,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:17,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:17,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:25:17,638 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:17,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 05:25:17,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:17,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 05:25:17,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2022-12-06 05:25:17,638 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 05:25:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1653590207, now seen corresponding path program 1 times [2022-12-06 05:25:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:17,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014609491] [2022-12-06 05:25:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:17,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 05:25:17,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:17,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014609491] [2022-12-06 05:25:17,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014609491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:17,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:17,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583175376] [2022-12-06 05:25:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:17,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:17,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:17,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:17,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:17,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:17,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 05:25:17,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:17,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:17,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:17,981 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:17,982 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:17,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 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 05:25:17,996 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:17,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:17,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:17,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 05:25:17,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25: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 05:25:18,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25: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 05:25:18,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:18,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:18,030 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:18,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:18,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,055 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:18,056 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 05:25:18,057 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 05:25:18,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:18,211 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:18,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:25:18,212 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:18,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 05:25:18,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:18,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 05:25:18,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2022-12-06 05:25:18,212 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 05:25:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash -898566754, now seen corresponding path program 1 times [2022-12-06 05:25:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:18,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416714875] [2022-12-06 05:25:18,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:18,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416714875] [2022-12-06 05:25:18,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416714875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:18,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:18,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250382025] [2022-12-06 05:25:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:18,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:18,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:18,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:18,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:18,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:18,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:18,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:18,561 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:18,562 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:18,569 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 05:25:18,576 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:18,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:18,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:18,577 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:18,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:18,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 05:25:18,610 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,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 05:25:18,610 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:18,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:18,610 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:18,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:18,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,635 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:18,635 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:25:18,636 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 05:25:18,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:18,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:18,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:18,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:25:18,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:18,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 05:25:18,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:18,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 05:25:18,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2022-12-06 05:25:18,810 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 05:25:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash 844243581, now seen corresponding path program 1 times [2022-12-06 05:25:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:18,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262158537] [2022-12-06 05:25:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262158537] [2022-12-06 05:25:18,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262158537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:18,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:18,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:18,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834949549] [2022-12-06 05:25:18,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:18,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:18,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:18,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:18,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:18,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:18,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:19,176 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:19,177 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:19,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 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 05:25:19,190 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:19,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:19,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:19,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 05:25:19,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:19,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 05:25:19,220 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,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 05:25:19,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:19,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:19,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:19,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:19,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,245 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:19,246 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:25:19,247 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 05:25:19,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:19,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:19,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:25:19,388 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:19,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 05:25:19,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:19,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 05:25:19,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2022-12-06 05:25:19,388 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 05:25:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1707913380, now seen corresponding path program 1 times [2022-12-06 05:25:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:19,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587116826] [2022-12-06 05:25:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:19,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587116826] [2022-12-06 05:25:19,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587116826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:19,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:19,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111835625] [2022-12-06 05:25:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:19,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:19,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:19,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:19,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:19,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:19,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:19,726 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:19,726 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:19,733 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 05:25:19,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:19,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:19,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:19,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 05:25:19,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:19,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:19,772 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:19,772 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:19,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:19,772 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:19,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:19,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,797 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:19,797 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:25:19,798 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 05:25:19,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:19,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:19,941 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:19,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:19,941 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:19,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 05:25:19,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:19,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 05:25:19,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2022-12-06 05:25:19,942 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 05:25:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash 34896955, now seen corresponding path program 1 times [2022-12-06 05:25:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:19,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502119234] [2022-12-06 05:25:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:20,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:20,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502119234] [2022-12-06 05:25:20,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502119234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:20,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:20,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425272574] [2022-12-06 05:25:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:20,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:20,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:20,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 05:25:20,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:20,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:20,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:20,291 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:20,291 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:20,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:20,308 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:20,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:20,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:20,308 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:20,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:20,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 05:25:20,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,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 05:25:20,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:20,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:20,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:20,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:20,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,369 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:20,369 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 05:25:20,370 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 05:25:20,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:20,520 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:20,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:25:20,521 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:20,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:20,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:20,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:20,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2022-12-06 05:25:20,521 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 05:25:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1777707290, now seen corresponding path program 1 times [2022-12-06 05:25:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:20,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508629300] [2022-12-06 05:25:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:20,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:20,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508629300] [2022-12-06 05:25:20,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508629300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:20,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:20,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632884526] [2022-12-06 05:25:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:20,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:20,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:20,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:20,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:20,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:20,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:20,876 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:20,876 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:20,883 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 05:25:20,891 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:20,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:20,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:20,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:20,892 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:20,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:20,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 05:25:20,934 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:20,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:20,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:20,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:20,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:20,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,959 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:20,959 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:20,960 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 05:25:20,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:20,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:21,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:21,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:25:21,108 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:21,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:21,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:21,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:21,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2022-12-06 05:25:21,108 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 05:25:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash -774449671, now seen corresponding path program 1 times [2022-12-06 05:25:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:21,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892092909] [2022-12-06 05:25:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:21,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 05:25:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:21,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892092909] [2022-12-06 05:25:21,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892092909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:21,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:21,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558982378] [2022-12-06 05:25:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:21,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:21,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:21,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:21,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:21,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 05:25:21,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:21,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:21,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:21,468 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:21,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:21,482 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:21,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:21,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25: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 05:25:21,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:21,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 05:25:21,515 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:21,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 05:25:21,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:21,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:21,515 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:21,516 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:21,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:21,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:21,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:21,540 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:21,540 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:21,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 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 05:25:21,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:21,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:21,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:21,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:25:21,680 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:21,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:21,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:21,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:21,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2022-12-06 05:25:21,680 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 05:25:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 968360664, now seen corresponding path program 1 times [2022-12-06 05:25:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:21,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41183326] [2022-12-06 05:25:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:21,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:21,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41183326] [2022-12-06 05:25:21,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41183326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:21,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:21,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573447601] [2022-12-06 05:25:21,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:21,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:21,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:21,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:21,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:21,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:21,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:22,032 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:22,033 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:22,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:22,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:22,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:22,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:22,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 05:25:22,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:22,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:22,073 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:22,073 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:22,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:22,073 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:22,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:22,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,098 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:22,098 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:25:22,099 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 05:25:22,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:22,266 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:22,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:25:22,267 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:22,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 05:25:22,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:22,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 05:25:22,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2022-12-06 05:25:22,267 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 05:25:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1583796297, now seen corresponding path program 1 times [2022-12-06 05:25:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:22,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408149024] [2022-12-06 05:25:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:22,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:22,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 05:25:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408149024] [2022-12-06 05:25:22,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408149024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:22,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:22,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233974167] [2022-12-06 05:25:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:22,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:22,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:22,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 05:25:22,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:22,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:22,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:22,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:22,621 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:22,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:22,635 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:22,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:22,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:22,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 05:25:22,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:22,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 05:25:22,668 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,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 05:25:22,668 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:22,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:22,669 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:22,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:22,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,693 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:22,694 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:22,695 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 05:25:22,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:22,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:22,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:22,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:25:22,858 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:22,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:22,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:22,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:22,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2022-12-06 05:25:22,858 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 05:25:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 159014038, now seen corresponding path program 1 times [2022-12-06 05:25:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:22,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812828268] [2022-12-06 05:25:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:22,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 05:25:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:22,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812828268] [2022-12-06 05:25:22,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812828268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:22,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:22,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658256916] [2022-12-06 05:25:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:22,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:22,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:22,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:22,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:22,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:22,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:23,201 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:23,202 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:23,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:23,217 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:23,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:23,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:23,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 05:25:23,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:23,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:23,250 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,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 05:25:23,251 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:23,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:23,251 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,251 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:23,251 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:23,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,275 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:23,276 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:25:23,277 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 05:25:23,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:23,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:23,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:25:23,416 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25: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 05:25:23,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25: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 05:25:23,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2022-12-06 05:25:23,416 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 05:25:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1901824373, now seen corresponding path program 1 times [2022-12-06 05:25:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:23,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518928395] [2022-12-06 05:25:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:23,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:23,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518928395] [2022-12-06 05:25:23,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518928395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:23,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:23,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450875846] [2022-12-06 05:25:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:23,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:23,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:23,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:23,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:23,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:23,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:23,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:23,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:23,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:23,756 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:23,763 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 05:25:23,770 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:23,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:23,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:23,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 05:25:23,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:23,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:23,803 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:23,804 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:23,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:23,804 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:23,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:23,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,829 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:23,829 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:23,830 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 05:25:23,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:23,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:23,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:23,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:25:23,974 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:23,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:23,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:23,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:23,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2022-12-06 05:25:23,975 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 05:25:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash -650332588, now seen corresponding path program 1 times [2022-12-06 05:25:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:23,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752883654] [2022-12-06 05:25:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:24,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 05:25:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:24,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752883654] [2022-12-06 05:25:24,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752883654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:24,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:24,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017907473] [2022-12-06 05:25:24,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:24,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:24,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:24,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 05:25:24,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:24,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:24,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:24,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:24,307 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:24,314 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 05:25:24,321 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:24,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:24,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:24,322 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:24,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:24,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:24,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,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 05:25:24,356 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:24,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:24,356 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:24,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:24,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,381 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:24,381 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:25:24,382 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 05:25:24,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:24,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:24,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:25:24,536 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:24,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:24,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:24,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 05:25:24,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2022-12-06 05:25:24,537 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 05:25:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:24,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1092477747, now seen corresponding path program 1 times [2022-12-06 05:25:24,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:24,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431905074] [2022-12-06 05:25:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:24,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431905074] [2022-12-06 05:25:24,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431905074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:24,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:24,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423556464] [2022-12-06 05:25:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:24,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:24,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:24,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:24,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:24,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:24,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:24,885 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:24,885 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:24,892 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 05:25:24,899 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:24,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:24,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:24,900 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:24,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:24,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 05:25:24,935 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,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 05:25:24,935 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:24,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:24,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:24,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:24,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,971 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:24,971 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:24,973 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 05:25:24,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:24,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:25,136 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:25,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 05:25:25,136 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:25,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:25,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:25,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:25,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2022-12-06 05:25:25,137 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 05:25:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1459679214, now seen corresponding path program 1 times [2022-12-06 05:25:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:25,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091323270] [2022-12-06 05:25:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:25,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 05:25:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:25,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091323270] [2022-12-06 05:25:25,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091323270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:25,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:25,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18287] [2022-12-06 05:25:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:25,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:25,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:25,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 05:25:25,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:25,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:25,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:25,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:25,468 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:25,475 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 05:25:25,483 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:25,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:25,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:25,484 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:25,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:25,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:25,518 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:25,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:25,518 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:25,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:25,518 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:25,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:25,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:25,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:25,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:25,543 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:25,543 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:25,544 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 05:25:25,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:25,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:25,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:25,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 05:25:25,713 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:25,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:25,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:25,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:25,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2022-12-06 05:25:25,714 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 05:25:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash 283131121, now seen corresponding path program 1 times [2022-12-06 05:25:25,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:25,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268999724] [2022-12-06 05:25:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:25,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 05:25:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268999724] [2022-12-06 05:25:25,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268999724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:25,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:25,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954330748] [2022-12-06 05:25:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:25,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:25,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:25,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 05:25:25,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:25,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:25,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:26,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:26,045 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:26,052 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 05:25:26,059 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:26,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:26,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:26,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 05:25:26,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:26,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 05:25:26,093 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,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 05:25:26,093 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:26,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:26,093 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:26,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:26,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,118 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:26,118 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:26,120 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 05:25:26,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:26,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:26,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:25:26,283 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:26,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 05:25:26,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:26,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 05:25:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2022-12-06 05:25:26,283 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 05:25:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2025941456, now seen corresponding path program 1 times [2022-12-06 05:25:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455434419] [2022-12-06 05:25:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:26,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 05:25:26,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:26,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455434419] [2022-12-06 05:25:26,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455434419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:26,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:26,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530511456] [2022-12-06 05:25:26,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:26,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:26,342 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:26,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 05:25:26,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:26,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:26,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:26,628 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:26,628 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:26,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 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 05:25:26,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:26,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:26,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:26,641 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:26,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:26,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 05:25:26,668 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,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 05:25:26,668 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:26,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:26,668 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:26,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:26,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,693 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:26,693 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:25:26,694 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 05:25:26,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:26,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:26,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:26,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:25:26,839 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:26,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 05:25:26,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:26,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 05:25:26,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2022-12-06 05:25:26,839 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 05:25:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash -526215505, now seen corresponding path program 1 times [2022-12-06 05:25:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:26,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316404691] [2022-12-06 05:25:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:26,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316404691] [2022-12-06 05:25:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316404691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:26,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:26,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878254957] [2022-12-06 05:25:26,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:26,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:26,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 05:25:26,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:26,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:26,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:27,160 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:27,161 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:27,167 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 05:25:27,174 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:27,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:27,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:27,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 05:25:27,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:27,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 05:25:27,209 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,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 05:25:27,209 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:27,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:27,209 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:27,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:27,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,233 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:27,233 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:27,234 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 05:25:27,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:27,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:27,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:25:27,379 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:27,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:27,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:27,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:27,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2022-12-06 05:25:27,380 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 05:25:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1216594830, now seen corresponding path program 1 times [2022-12-06 05:25:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:27,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760746542] [2022-12-06 05:25:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:27,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 05:25:27,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:27,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760746542] [2022-12-06 05:25:27,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760746542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:27,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:27,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150454632] [2022-12-06 05:25:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:27,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:27,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:27,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:27,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 05:25:27,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:27,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:27,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:27,726 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:27,727 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:27,733 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 05:25:27,740 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:27,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:27,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:27,741 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:27,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:27,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:27,774 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:27,774 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:27,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:27,774 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:27,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:27,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,799 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:27,799 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:27,800 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 05:25:27,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:27,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:27,952 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:27,952 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:25:27,953 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:27,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 05:25:27,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:27,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 05:25:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2022-12-06 05:25:27,953 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 05:25:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1335562131, now seen corresponding path program 1 times [2022-12-06 05:25:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426601070] [2022-12-06 05:25:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:28,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:28,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426601070] [2022-12-06 05:25:28,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426601070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:28,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:28,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:28,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892292851] [2022-12-06 05:25:28,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:28,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:28,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:28,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:28,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:28,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 05:25:28,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:28,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:28,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:28,286 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:28,286 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:28,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 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 05:25:28,300 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:28,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:28,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:28,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 05:25:28,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:28,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 05:25:28,334 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,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 05:25:28,334 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:28,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:28,334 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:28,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:28,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,359 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:28,359 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:28,360 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 05:25:28,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:28,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:28,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:28,503 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:28,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 05:25:28,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:28,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 05:25:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2022-12-06 05:25:28,503 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 05:25:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash 407248204, now seen corresponding path program 1 times [2022-12-06 05:25:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:28,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950416529] [2022-12-06 05:25:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:28,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 05:25:28,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950416529] [2022-12-06 05:25:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950416529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:28,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312597867] [2022-12-06 05:25:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:28,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:28,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 05:25:28,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:28,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:28,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:28,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:28,833 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:28,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:28,847 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:28,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:28,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:28,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 05:25:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:28,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 05:25:28,879 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,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 05:25:28,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:28,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:28,879 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:28,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:28,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,904 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:28,904 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:25:28,905 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 05:25:28,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:28,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:29,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:29,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:25:29,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:29,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 05:25:29,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:29,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:29,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2022-12-06 05:25:29,064 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 05:25:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2144908757, now seen corresponding path program 1 times [2022-12-06 05:25:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849662059] [2022-12-06 05:25:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:29,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849662059] [2022-12-06 05:25:29,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849662059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:29,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:29,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783280499] [2022-12-06 05:25:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:29,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:29,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:29,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:29,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:29,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:29,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:29,405 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:29,405 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:25:29,412 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 05:25:29,419 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:29,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:29,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:29,420 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:29,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:29,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 05:25:29,452 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:29,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 05:25:29,453 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:29,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:29,453 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:29,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:29,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:29,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:29,487 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:29,488 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:25:29,489 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 05:25:29,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:29,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:29,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:29,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:25:29,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:29,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:29,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:29,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:29,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2022-12-06 05:25:29,647 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 05:25:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash -402098422, now seen corresponding path program 1 times [2022-12-06 05:25:29,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:29,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403816050] [2022-12-06 05:25:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:29,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 05:25:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:29,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403816050] [2022-12-06 05:25:29,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403816050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:29,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:29,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060261873] [2022-12-06 05:25:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:29,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:29,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:29,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:29,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:29,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 05:25:29,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:29,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:29,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:30,001 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:30,002 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:30,009 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 05:25:30,016 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:30,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:30,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:30,017 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:30,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:30,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 05:25:30,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,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 05:25:30,052 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:30,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:30,052 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:30,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:30,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,079 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:30,079 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:30,080 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 05:25:30,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:30,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:30,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:25:30,230 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:30,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 05:25:30,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:30,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 05:25:30,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2022-12-06 05:25:30,230 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 05:25:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1340711913, now seen corresponding path program 1 times [2022-12-06 05:25:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386421280] [2022-12-06 05:25:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:30,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 05:25:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:30,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386421280] [2022-12-06 05:25:30,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386421280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:30,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:30,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791149825] [2022-12-06 05:25:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:30,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:30,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:30,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 05:25:30,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:30,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:30,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:30,568 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:30,568 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:25:30,575 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 05:25:30,582 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:30,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:30,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:30,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 05:25:30,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:30,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:30,613 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:30,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:30,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:30,614 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:30,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:30,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,638 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:30,638 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:25:30,639 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 05:25:30,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:30,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:30,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:30,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:25:30,786 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:30,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 05:25:30,786 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:30,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 05:25:30,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2022-12-06 05:25:30,787 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 05:25:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1211445048, now seen corresponding path program 1 times [2022-12-06 05:25:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:30,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969927845] [2022-12-06 05:25:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:30,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:30,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969927845] [2022-12-06 05:25:30,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969927845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:30,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:30,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326899057] [2022-12-06 05:25:30,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:30,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:30,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:30,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:30,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:30,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:30,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:31,131 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:31,132 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:31,138 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 05:25:31,144 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:31,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:31,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:31,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:31,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:31,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 05:25:31,172 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:31,172 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:31,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:31,172 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:31,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:31,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,196 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:31,197 INFO L131 PetriNetUnfolder]: For 3175/3318 co-relation queries the response was YES. [2022-12-06 05:25:31,198 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 05:25:31,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:31,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:31,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:25:31,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:31,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 05:25:31,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:31,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 05:25:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2022-12-06 05:25:31,353 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 05:25:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 531365287, now seen corresponding path program 1 times [2022-12-06 05:25:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:31,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588972767] [2022-12-06 05:25:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:31,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588972767] [2022-12-06 05:25:31,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588972767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:31,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:31,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44274104] [2022-12-06 05:25:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:31,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:31,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:31,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:31,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:31,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:31,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:31,711 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:31,712 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:31,718 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 05:25:31,726 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:31,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:31,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:31,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 05:25:31,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:31,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 05:25:31,762 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,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 05:25:31,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:31,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:31,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,763 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:31,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:31,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,787 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:31,787 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:31,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 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 05:25:31,790 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:31,790 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:31,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:31,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:25:31,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:31,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 05:25:31,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:31,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 05:25:31,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2022-12-06 05:25:31,950 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 05:25:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2020791674, now seen corresponding path program 1 times [2022-12-06 05:25:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:31,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020038759] [2022-12-06 05:25:31,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:32,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020038759] [2022-12-06 05:25:32,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020038759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:32,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:32,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141107470] [2022-12-06 05:25:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:32,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:32,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 05:25:32,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:32,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:32,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:32,280 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:32,281 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:32,288 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 05:25:32,295 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:32,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:32,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:32,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 05:25:32,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:32,328 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,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 05:25:32,328 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:32,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:32,328 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:32,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:32,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,353 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:32,353 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:32,354 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 05:25:32,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:32,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:32,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:25:32,504 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:32,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 05:25:32,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:32,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 05:25:32,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2022-12-06 05:25:32,505 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 05:25:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash -277981339, now seen corresponding path program 1 times [2022-12-06 05:25:32,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:32,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217729463] [2022-12-06 05:25:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:32,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 05:25:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:32,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217729463] [2022-12-06 05:25:32,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217729463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:32,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:32,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680452896] [2022-12-06 05:25:32,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:32,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:32,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:32,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:32,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:32,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 05:25:32,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:32,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:32,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:32,838 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:32,838 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:32,845 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 05:25:32,852 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:32,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:32,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:32,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 05:25:32,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:32,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 05:25:32,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,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 05:25:32,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:32,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:32,884 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:32,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:32,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,910 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:32,910 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:25:32,911 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 05:25:32,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:32,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:33,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:33,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:25:33,050 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:33,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 05:25:33,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:33,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 05:25:33,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2022-12-06 05:25:33,051 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 05:25:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:33,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1464828996, now seen corresponding path program 1 times [2022-12-06 05:25:33,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:33,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085999143] [2022-12-06 05:25:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:33,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 05:25:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085999143] [2022-12-06 05:25:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085999143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216786588] [2022-12-06 05:25:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:33,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:33,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:33,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:33,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:33,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 05:25:33,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:33,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:33,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:33,389 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:33,389 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:33,395 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 05:25:33,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:33,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:33,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:33,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 05:25:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:33,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 05:25:33,435 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,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 05:25:33,435 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:33,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:33,436 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:33,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:33,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,460 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:33,461 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 05:25:33,462 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 05:25:33,463 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:33,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:33,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:25:33,602 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:33,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 05:25:33,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:33,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 05:25:33,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2022-12-06 05:25:33,602 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 05:25:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1087327965, now seen corresponding path program 1 times [2022-12-06 05:25:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:33,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251821300] [2022-12-06 05:25:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:33,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:33,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251821300] [2022-12-06 05:25:33,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251821300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:33,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:33,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554136108] [2022-12-06 05:25:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:33,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:33,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:33,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 05:25:33,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:33,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:33,941 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:33,942 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:33,949 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 05:25:33,957 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:33,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:33,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:33,958 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:33,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:33,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:33,989 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:33,989 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:33,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:33,990 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:33,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:33,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:33,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,021 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:34,021 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:34,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 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 05:25:34,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:34,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:34,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:25:34,186 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:34,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:34,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:34,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2022-12-06 05:25:34,186 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 05:25:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash 655482370, now seen corresponding path program 1 times [2022-12-06 05:25:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:34,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742394838] [2022-12-06 05:25:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:34,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742394838] [2022-12-06 05:25:34,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742394838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:34,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:34,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339360125] [2022-12-06 05:25:34,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:34,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:34,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:34,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:34,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 05:25:34,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:34,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:34,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:34,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:34,525 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:34,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:34,539 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:34,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:34,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:34,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 05:25:34,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:34,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 05:25:34,574 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,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 05:25:34,574 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:34,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:34,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:34,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:34,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,599 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:34,599 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:25:34,601 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 05:25:34,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:34,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:34,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:34,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:25:34,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:34,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 05:25:34,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:34,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 05:25:34,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2022-12-06 05:25:34,755 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 05:25:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:34,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1896674591, now seen corresponding path program 1 times [2022-12-06 05:25:34,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:34,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532953139] [2022-12-06 05:25:34,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:34,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 05:25:34,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:34,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532953139] [2022-12-06 05:25:34,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532953139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:34,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:34,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585310956] [2022-12-06 05:25:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:34,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:34,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:34,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 05:25:34,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:34,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:34,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:35,089 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:35,089 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:35,096 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 05:25:35,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:35,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:35,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:35,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 05:25:35,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:35,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 05:25:35,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,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 05:25:35,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:35,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:35,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:35,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:35,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,162 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:35,162 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:35,164 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 05:25:35,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:35,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:35,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:25:35,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:35,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 05:25:35,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:35,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 05:25:35,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2022-12-06 05:25:35,308 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 05:25:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash -153864256, now seen corresponding path program 1 times [2022-12-06 05:25:35,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:35,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177051888] [2022-12-06 05:25:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:35,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:35,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177051888] [2022-12-06 05:25:35,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177051888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:35,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:35,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516651806] [2022-12-06 05:25:35,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:35,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:35,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:35,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:35,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:35,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:35,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:35,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:35,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:35,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:35,674 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:35,681 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 05:25:35,687 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:35,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:35,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:35,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 05:25:35,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:35,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 05:25:35,717 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,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 05:25:35,718 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:35,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:35,718 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:35,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:35,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,742 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:35,743 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:25:35,744 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 05:25:35,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:35,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:35,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:35,894 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:25:35,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:35,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 05:25:35,894 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:35,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 05:25:35,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2022-12-06 05:25:35,894 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 05:25:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1588946079, now seen corresponding path program 1 times [2022-12-06 05:25:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:35,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982166347] [2022-12-06 05:25:35,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:35,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 05:25:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:35,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982166347] [2022-12-06 05:25:35,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982166347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:35,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:35,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743066985] [2022-12-06 05:25:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:35,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:35,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:35,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 05:25:35,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:35,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:35,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:36,269 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:36,269 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:36,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 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 05:25:36,283 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:36,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:36,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:36,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 05:25:36,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:36,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 05:25:36,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,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 05:25:36,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:36,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:36,319 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:36,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:36,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,344 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:36,344 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:36,345 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 05:25:36,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:36,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:36,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:25:36,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:36,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 05:25:36,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:36,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 05:25:36,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2022-12-06 05:25:36,509 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 05:25:36,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash -963210882, now seen corresponding path program 1 times [2022-12-06 05:25:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:36,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112773362] [2022-12-06 05:25:36,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:36,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:36,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 05:25:36,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:36,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112773362] [2022-12-06 05:25:36,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112773362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:36,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:36,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600485327] [2022-12-06 05:25:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:36,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:36,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:36,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 05:25:36,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:36,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:36,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:36,852 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:36,852 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:36,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:36,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:36,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:36,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:36,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 05:25:36,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:36,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 05:25:36,901 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,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 05:25:36,901 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:36,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:36,901 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:36,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:36,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,926 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:36,926 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:25:36,927 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 05:25:36,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:36,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:37,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:37,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:25:37,093 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:37,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 05:25:37,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:37,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 05:25:37,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2022-12-06 05:25:37,093 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 05:25:37,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 779599453, now seen corresponding path program 1 times [2022-12-06 05:25:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:37,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592799939] [2022-12-06 05:25:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:37,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 05:25:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592799939] [2022-12-06 05:25:37,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592799939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:37,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:37,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185103610] [2022-12-06 05:25:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:37,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:37,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:37,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 05:25:37,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:37,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:37,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:37,458 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:37,458 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:37,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:37,473 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:37,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:37,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:37,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:37,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 05:25:37,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:37,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 05:25:37,508 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:37,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 05:25:37,508 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:37,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:37,509 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:37,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:37,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:37,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:37,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:37,533 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:37,534 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:37,534 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 05:25:37,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:37,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:37,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:37,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:25:37,680 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:37,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 05:25:37,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:37,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 05:25:37,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2022-12-06 05:25:37,681 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 05:25:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1772557508, now seen corresponding path program 1 times [2022-12-06 05:25:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034835168] [2022-12-06 05:25:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:37,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 05:25:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:37,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034835168] [2022-12-06 05:25:37,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034835168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:37,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:37,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406833480] [2022-12-06 05:25:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:37,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:37,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:37,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 05:25:37,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:37,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:37,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:38,028 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:38,028 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:38,035 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 05:25:38,042 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:38,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:38,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:38,043 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:38,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 05:25:38,077 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,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 05:25:38,077 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:38,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:38,077 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:38,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:38,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,102 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:38,102 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:25:38,103 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 05:25:38,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:38,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:38,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:25:38,260 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:38,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 05:25:38,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:38,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 05:25:38,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2022-12-06 05:25:38,260 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 05:25:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash -29747173, now seen corresponding path program 1 times [2022-12-06 05:25:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:38,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177070062] [2022-12-06 05:25:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:38,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 05:25:38,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177070062] [2022-12-06 05:25:38,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177070062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:38,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:38,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224111232] [2022-12-06 05:25:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:38,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:38,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:38,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:38,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 05:25:38,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:38,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:38,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:38,631 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:38,631 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:25:38,637 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 05:25:38,643 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:38,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:38,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:38,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 05:25:38,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:38,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 05:25:38,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,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 05:25:38,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:38,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:38,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:38,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:38,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,698 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:38,698 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:25:38,699 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 05:25:38,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:38,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:38,844 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:38,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:25:38,845 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:38,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:38,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:38,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:38,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2022-12-06 05:25:38,845 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 05:25:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1713063162, now seen corresponding path program 1 times [2022-12-06 05:25:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:38,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789905233] [2022-12-06 05:25:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:38,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 05:25:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:38,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789905233] [2022-12-06 05:25:38,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789905233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:38,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:38,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056889307] [2022-12-06 05:25:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:38,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:38,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:38,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:38,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 05:25:38,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:38,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:38,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:39,177 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:39,177 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:39,185 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 05:25:39,192 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:39,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:39,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:39,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 05:25:39,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:39,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:39,223 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,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 05:25:39,223 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:39,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:39,224 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:39,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:39,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,248 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:39,248 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:39,249 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 05:25:39,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:39,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:39,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:25:39,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:39,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 05:25:39,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:39,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 05:25:39,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2022-12-06 05:25:39,411 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 05:25:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash -839093799, now seen corresponding path program 1 times [2022-12-06 05:25:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:39,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76882606] [2022-12-06 05:25:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:39,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 05:25:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:39,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76882606] [2022-12-06 05:25:39,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76882606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:39,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:39,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261492285] [2022-12-06 05:25:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:39,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:39,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:39,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 05:25:39,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:39,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:39,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:39,749 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:39,756 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 05:25:39,763 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:39,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:39,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:39,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 05:25:39,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:39,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 05:25:39,796 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,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 05:25:39,797 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:39,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:39,797 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:39,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:39,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,821 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:39,822 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:25:39,823 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 05:25:39,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:39,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:39,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:39,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:25:39,976 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:39,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:39,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:39,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:39,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2022-12-06 05:25:39,977 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 05:25:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 903716536, now seen corresponding path program 1 times [2022-12-06 05:25:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:39,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256746031] [2022-12-06 05:25:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:40,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 05:25:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:40,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256746031] [2022-12-06 05:25:40,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256746031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:40,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:40,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552787674] [2022-12-06 05:25:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:40,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:40,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:40,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:40,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:40,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 05:25:40,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:40,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:40,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:40,330 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:40,330 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:40,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 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 05:25:40,345 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:40,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:40,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:40,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 05:25:40,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25: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 05:25:40,376 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25: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 05:25:40,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:40,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:40,376 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:40,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:40,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,401 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:40,402 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 05:25:40,403 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 05:25:40,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:40,542 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:40,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:25:40,543 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:40,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:40,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:40,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:40,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2022-12-06 05:25:40,543 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 05:25:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1648440425, now seen corresponding path program 1 times [2022-12-06 05:25:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:40,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716581719] [2022-12-06 05:25:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:40,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 05:25:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:40,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716581719] [2022-12-06 05:25:40,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716581719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:40,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:40,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:40,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651157237] [2022-12-06 05:25:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:40,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:40,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:40,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 05:25:40,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:40,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:40,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:40,880 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:40,880 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:25:40,887 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 05:25:40,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:40,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:40,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:40,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 05:25:40,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:40,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:40,932 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,932 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:40,932 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:40,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:40,933 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:40,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:40,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,960 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:40,960 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:25:40,961 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 05:25:40,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:40,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:41,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:41,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:25:41,128 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:41,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 05:25:41,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:41,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 05:25:41,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2022-12-06 05:25:41,128 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 05:25:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash 94369910, now seen corresponding path program 1 times [2022-12-06 05:25:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:41,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17585712] [2022-12-06 05:25:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:41,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 05:25:41,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:41,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17585712] [2022-12-06 05:25:41,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17585712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:41,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:41,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130163030] [2022-12-06 05:25:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:41,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:41,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:41,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 05:25:41,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:41,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:41,462 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:41,462 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:25:41,469 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 05:25:41,477 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:41,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:41,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:41,478 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:41,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:41,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:41,514 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:41,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 05:25:41,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:41,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:41,515 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:41,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:41,516 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:41,516 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:41,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:41,540 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:41,540 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:41,552 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 05:25:41,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:41,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:41,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:41,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:25:41,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:41,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 05:25:41,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:41,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 05:25:41,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2022-12-06 05:25:41,703 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 05:25:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1837180245, now seen corresponding path program 1 times [2022-12-06 05:25:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:41,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680292276] [2022-12-06 05:25:41,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:41,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 05:25:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:41,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680292276] [2022-12-06 05:25:41,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680292276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:41,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:41,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518237303] [2022-12-06 05:25:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:41,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:41,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:41,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 05:25:41,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:41,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:42,029 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:42,029 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:25:42,036 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 05:25:42,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:42,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:42,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:42,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 05:25:42,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:42,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:42,078 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:42,078 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:42,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:42,078 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:42,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:42,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,103 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:42,103 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:42,104 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 05:25:42,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:42,250 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:42,250 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:25:42,250 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:42,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 05:25:42,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:42,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 05:25:42,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2022-12-06 05:25:42,251 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 05:25:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash -714976716, now seen corresponding path program 1 times [2022-12-06 05:25:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:42,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391030899] [2022-12-06 05:25:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:42,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391030899] [2022-12-06 05:25:42,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391030899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:42,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:42,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354656520] [2022-12-06 05:25:42,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:42,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:42,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:42,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:42,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:42,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:42,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:42,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:42,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:42,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:42,590 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:42,590 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:42,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 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 05:25:42,605 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:42,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:42,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:42,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 05:25:42,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:42,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:42,639 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:42,639 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:42,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:42,639 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:42,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:42,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,664 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:42,664 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:25:42,665 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 05:25:42,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:42,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:42,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:42,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:25:42,821 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:42,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 05:25:42,821 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:42,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 05:25:42,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2022-12-06 05:25:42,822 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 05:25:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1027833619, now seen corresponding path program 1 times [2022-12-06 05:25:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:42,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869058236] [2022-12-06 05:25:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:42,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 05:25:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:42,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869058236] [2022-12-06 05:25:42,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869058236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:42,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:42,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695653139] [2022-12-06 05:25:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:42,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:42,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:42,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:42,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:42,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 05:25:42,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:42,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:42,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:43,180 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:43,181 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:25:43,187 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 05:25:43,193 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:43,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:43,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25: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 05:25:43,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:43,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:43,223 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,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 05:25:43,223 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:43,223 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:43,224 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:43,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:43,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,249 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:43,249 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:25:43,250 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 05:25:43,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:43,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:43,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:25:43,397 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:43,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:43,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:43,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:43,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2022-12-06 05:25:43,397 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 05:25:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1524323342, now seen corresponding path program 1 times [2022-12-06 05:25:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:43,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448050935] [2022-12-06 05:25:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:43,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 05:25:43,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:43,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448050935] [2022-12-06 05:25:43,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448050935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:43,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:43,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252640398] [2022-12-06 05:25:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:43,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:43,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:43,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:43,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:43,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 05:25:43,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:43,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:43,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:43,741 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:43,742 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:43,748 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 05:25:43,756 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:43,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:43,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:43,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 05:25:43,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:43,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:43,788 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,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 05:25:43,789 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:43,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:43,789 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:43,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:43,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,813 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:43,814 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:43,815 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 05:25:43,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:43,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:43,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:43,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:25:43,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:43,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 05:25:43,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:43,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 05:25:43,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2022-12-06 05:25:43,956 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 05:25:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 218486993, now seen corresponding path program 1 times [2022-12-06 05:25:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:43,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143714289] [2022-12-06 05:25:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:44,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143714289] [2022-12-06 05:25:44,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143714289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:44,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:44,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373096443] [2022-12-06 05:25:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:44,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:44,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:44,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:44,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:44,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 05:25:44,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:44,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:44,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:44,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:44,284 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:44,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 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 05:25:44,299 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:44,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:44,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:44,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 05:25:44,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:44,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 05:25:44,331 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,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 05:25:44,332 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:44,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:44,332 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:44,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:44,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,356 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:44,357 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:44,358 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 05:25:44,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:44,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:44,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:25:44,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:44,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 05:25:44,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:44,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 05:25:44,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2022-12-06 05:25:44,510 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 05:25:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1961297328, now seen corresponding path program 1 times [2022-12-06 05:25:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030224130] [2022-12-06 05:25:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:44,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 05:25:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030224130] [2022-12-06 05:25:44,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030224130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:44,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:44,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533036034] [2022-12-06 05:25:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:44,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:44,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:44,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:44,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:44,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 05:25:44,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:44,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:44,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:44,847 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:44,847 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:44,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:44,862 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:44,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:44,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:44,863 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:44,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:44,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 05:25:44,897 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:44,897 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:44,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:44,897 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:44,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:44,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,922 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:44,922 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:25:44,923 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 05:25:44,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:44,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:45,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:45,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:25:45,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:45,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 05:25:45,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:45,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2022-12-06 05:25:45,070 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 05:25:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -590859633, now seen corresponding path program 1 times [2022-12-06 05:25:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:45,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420085676] [2022-12-06 05:25:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:45,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 05:25:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:45,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420085676] [2022-12-06 05:25:45,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420085676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:45,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:45,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578864105] [2022-12-06 05:25:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:45,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:45,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:45,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:45,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:45,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:45,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:45,397 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:45,397 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:45,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 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 05:25:45,412 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:45,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:45,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:45,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 05:25:45,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:45,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 05:25:45,445 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:45,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 05:25:45,445 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:45,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:45,445 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:45,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:45,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:45,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:45,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:45,470 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:45,470 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:25:45,471 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 05:25:45,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:45,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:45,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:45,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:25:45,638 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:45,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 05:25:45,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:45,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 05:25:45,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2022-12-06 05:25:45,638 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 05:25:45,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1151950702, now seen corresponding path program 1 times [2022-12-06 05:25:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:45,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088789264] [2022-12-06 05:25:45,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:45,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088789264] [2022-12-06 05:25:45,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088789264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:45,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:45,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904685774] [2022-12-06 05:25:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:45,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:45,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 05:25:45,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:45,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:45,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:45,963 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:45,964 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:45,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:45,977 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:45,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:45,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:45,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 05:25:45,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:46,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 05:25:46,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,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 05:25:46,011 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:46,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:46,011 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:46,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:46,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,046 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:46,046 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:25:46,047 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 05:25:46,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:46,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:46,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:25:46,188 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:46,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 05:25:46,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:46,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 05:25:46,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2022-12-06 05:25:46,189 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 05:25:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:46,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1400206259, now seen corresponding path program 1 times [2022-12-06 05:25:46,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:46,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124321081] [2022-12-06 05:25:46,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:46,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124321081] [2022-12-06 05:25:46,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124321081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:46,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:46,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367831838] [2022-12-06 05:25:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:46,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:46,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:46,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:46,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:46,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:46,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:46,519 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:46,519 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:46,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 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 05:25:46,533 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:46,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:46,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:46,534 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:46,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 05:25:46,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,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 05:25:46,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:46,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:46,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:46,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:46,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,592 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:46,592 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:46,593 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 05:25:46,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:46,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:46,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:46,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:25:46,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25: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 05:25:46,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25: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 05:25:46,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2022-12-06 05:25:46,753 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 05:25:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash 342604076, now seen corresponding path program 1 times [2022-12-06 05:25:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:46,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812780801] [2022-12-06 05:25:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:46,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:46,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812780801] [2022-12-06 05:25:46,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812780801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:46,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:46,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563299564] [2022-12-06 05:25:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:46,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:46,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:46,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:46,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:46,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:46,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:46,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:46,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:47,084 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:47,084 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:47,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:47,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:47,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:47,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:47,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 05:25:47,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:47,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 05:25:47,134 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,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 05:25:47,134 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:47,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:47,134 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:47,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:47,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,159 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:47,159 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:25:47,160 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 05:25:47,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:47,321 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:47,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:25:47,322 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:47,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:47,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:47,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 05:25:47,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2022-12-06 05:25:47,322 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 05:25:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2085414411, now seen corresponding path program 1 times [2022-12-06 05:25:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:47,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200178982] [2022-12-06 05:25:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:47,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 05:25:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:47,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200178982] [2022-12-06 05:25:47,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200178982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:47,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:47,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101907518] [2022-12-06 05:25:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:47,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:47,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:47,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 05:25:47,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:47,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:47,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:47,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:47,666 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:25:47,672 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 05:25:47,678 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:47,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:47,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:47,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 05:25:47,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25: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 05:25:47,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25: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 05:25:47,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:47,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:47,707 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:47,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:47,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,732 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:47,733 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:25:47,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 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 05:25:47,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:47,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:47,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:47,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:25:47,887 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:47,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 05:25:47,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:47,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 05:25:47,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2022-12-06 05:25:47,887 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 05:25:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:47,888 INFO L85 PathProgramCache]: Analyzing trace with hash -466742550, now seen corresponding path program 1 times [2022-12-06 05:25:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:47,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309458232] [2022-12-06 05:25:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:47,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 05:25:47,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:47,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309458232] [2022-12-06 05:25:47,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309458232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:47,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:47,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445872656] [2022-12-06 05:25:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:47,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:47,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:47,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:47,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 05:25:47,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:47,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:47,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:48,224 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:48,224 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:48,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 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 05:25:48,238 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:48,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:48,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:48,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 05:25:48,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:48,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 05:25:48,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,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 05:25:48,274 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:48,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:48,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:48,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:48,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,298 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:48,298 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:48,300 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 05:25:48,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:48,437 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:48,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:25:48,438 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:48,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 05:25:48,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:48,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 05:25:48,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2022-12-06 05:25:48,438 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 05:25:48,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:48,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1276067785, now seen corresponding path program 1 times [2022-12-06 05:25:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:48,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948256018] [2022-12-06 05:25:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:48,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 05:25:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948256018] [2022-12-06 05:25:48,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948256018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:48,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:48,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644821843] [2022-12-06 05:25:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:48,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:48,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:48,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:48,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 05:25:48,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:48,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:48,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:48,775 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:48,775 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:25:48,782 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 05:25:48,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:48,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:48,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:48,791 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:48,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:48,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 05:25:48,824 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,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 05:25:48,824 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:48,825 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:48,825 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:48,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:48,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,849 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:48,850 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:25:48,851 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 05:25:48,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:48,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:49,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:49,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:25:49,005 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:49,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 05:25:49,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:49,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 05:25:49,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2022-12-06 05:25:49,005 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 05:25:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1276089176, now seen corresponding path program 1 times [2022-12-06 05:25:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:49,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106251103] [2022-12-06 05:25:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:49,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 05:25:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:49,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106251103] [2022-12-06 05:25:49,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106251103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:49,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:49,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048299070] [2022-12-06 05:25:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:49,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:49,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 05:25:49,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:49,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:49,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:49,336 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:49,336 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:49,343 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 05:25:49,350 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:49,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:49,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:49,351 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:49,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:49,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 05:25:49,384 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,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 05:25:49,384 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:49,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:49,384 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,385 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:49,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:49,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,409 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:49,409 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:25:49,410 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 05:25:49,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:49,549 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:49,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:25:49,549 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:49,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:49,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:49,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:49,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2022-12-06 05:25:49,550 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 05:25:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 466721159, now seen corresponding path program 1 times [2022-12-06 05:25:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:49,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512192991] [2022-12-06 05:25:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:49,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512192991] [2022-12-06 05:25:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512192991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:49,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214876739] [2022-12-06 05:25:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:49,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:49,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:49,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:49,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:49,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:49,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:49,895 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:49,895 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:49,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 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 05:25:49,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:49,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:49,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:49,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 05:25:49,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:49,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:49,943 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,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 05:25:49,943 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:49,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:49,943 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:49,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:49,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,969 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:49,969 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:25:49,970 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 05:25:49,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:49,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:50,118 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:50,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:25:50,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:50,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 05:25:50,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:50,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:50,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2022-12-06 05:25:50,119 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 05:25:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2085435802, now seen corresponding path program 1 times [2022-12-06 05:25:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:50,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521864154] [2022-12-06 05:25:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:50,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521864154] [2022-12-06 05:25:50,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521864154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:50,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:50,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527624911] [2022-12-06 05:25:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:50,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:50,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:50,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:50,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:50,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:50,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:50,461 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:50,461 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:25:50,468 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 05:25:50,475 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:50,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:50,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:50,476 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:50,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:50,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:50,510 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:50,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:50,510 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:50,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:50,510 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:50,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:50,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:50,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:50,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:50,547 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:50,547 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:50,548 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 05:25:50,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:50,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:50,692 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:50,692 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:25:50,692 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:50,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 05:25:50,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:50,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 05:25:50,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2022-12-06 05:25:50,693 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 05:25:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -342625467, now seen corresponding path program 1 times [2022-12-06 05:25:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:50,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046228971] [2022-12-06 05:25:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:50,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 05:25:50,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046228971] [2022-12-06 05:25:50,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046228971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:50,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:50,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:50,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28136794] [2022-12-06 05:25:50,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:50,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:50,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:50,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:50,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 05:25:50,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:50,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:50,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:51,032 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:51,032 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:25:51,039 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 05:25:51,046 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:51,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:51,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:51,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 05:25:51,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:51,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 05:25:51,086 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,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 05:25:51,086 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:51,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:51,086 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:51,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:51,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,111 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:51,112 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:25:51,113 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 05:25:51,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:51,287 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:51,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 05:25:51,287 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:51,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 05:25:51,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:51,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 05:25:51,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2022-12-06 05:25:51,288 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 05:25:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1400184868, now seen corresponding path program 1 times [2022-12-06 05:25:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:51,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748599576] [2022-12-06 05:25:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:51,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 05:25:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748599576] [2022-12-06 05:25:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748599576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:51,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462270291] [2022-12-06 05:25:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:51,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:51,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 05:25:51,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:51,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:51,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:51,645 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:51,645 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:51,652 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 05:25:51,659 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:51,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:51,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25: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 05:25:51,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:51,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 05:25:51,693 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,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 05:25:51,693 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:51,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:51,693 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:51,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:51,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,718 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:51,718 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:25:51,719 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 05:25:51,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:51,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:51,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:51,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:25:51,860 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:51,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 05:25:51,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:51,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 05:25:51,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2022-12-06 05:25:51,861 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 05:25:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1151972093, now seen corresponding path program 1 times [2022-12-06 05:25:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:51,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709395805] [2022-12-06 05:25:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:51,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709395805] [2022-12-06 05:25:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709395805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:51,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:51,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807957259] [2022-12-06 05:25:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:51,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:51,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:51,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 05:25:51,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:51,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:51,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:52,232 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:52,233 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:52,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:52,246 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:52,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:52,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:52,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 05:25:52,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:52,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:52,282 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,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 05:25:52,282 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:52,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:52,282 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:52,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:52,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,309 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:52,309 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:52,311 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 05:25:52,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:52,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:52,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:25:52,471 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:52,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 05:25:52,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:52,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 05:25:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2022-12-06 05:25:52,471 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 05:25:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash 590838242, now seen corresponding path program 1 times [2022-12-06 05:25:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:52,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757950962] [2022-12-06 05:25:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:52,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757950962] [2022-12-06 05:25:52,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757950962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:52,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:52,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388443651] [2022-12-06 05:25:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:52,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:52,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:52,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 05:25:52,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:52,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:52,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:52,862 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:52,862 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:52,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:52,877 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:52,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:52,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:52,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 05:25:52,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:52,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 05:25:52,912 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:52,912 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:52,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:52,912 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:52,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:52,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,939 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:52,939 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:52,940 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 05:25:52,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:52,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:53,124 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:53,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 05:25:53,125 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:53,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:53,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:53,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:53,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2022-12-06 05:25:53,125 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 05:25:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1961318719, now seen corresponding path program 1 times [2022-12-06 05:25:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:53,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609196615] [2022-12-06 05:25:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:53,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 05:25:53,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:53,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609196615] [2022-12-06 05:25:53,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609196615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:53,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:53,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275621459] [2022-12-06 05:25:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:53,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:53,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:53,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:53,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:53,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 05:25:53,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:53,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:53,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:53,473 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:53,473 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:53,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:53,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:53,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:53,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 05:25:53,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:53,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:53,519 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:53,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:53,519 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:53,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:53,519 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:53,519 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:53,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:53,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:53,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:53,543 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:53,544 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:53,545 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 05:25:53,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:53,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:53,687 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:53,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:53,688 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:53,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:53,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:53,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:53,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2022-12-06 05:25:53,688 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 05:25:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -218508384, now seen corresponding path program 1 times [2022-12-06 05:25:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:53,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861743384] [2022-12-06 05:25:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:53,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861743384] [2022-12-06 05:25:53,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861743384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:53,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:53,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414315023] [2022-12-06 05:25:53,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:53,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:53,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:53,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:53,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:53,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:53,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:53,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:54,031 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:54,031 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:54,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:54,045 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:54,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:54,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:54,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 05:25:54,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:54,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 05:25:54,079 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:54,079 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:54,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:54,080 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:54,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:54,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,104 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:54,104 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:25:54,106 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 05:25:54,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:54,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:54,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:25:54,253 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:54,253 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:54,253 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:54,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2022-12-06 05:25:54,254 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 05:25:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1524301951, now seen corresponding path program 1 times [2022-12-06 05:25:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:54,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899886018] [2022-12-06 05:25:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:54,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 05:25:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:54,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899886018] [2022-12-06 05:25:54,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899886018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:54,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:54,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791180017] [2022-12-06 05:25:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:54,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:54,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:54,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:54,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 05:25:54,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:54,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:54,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:54,583 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:54,584 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:25:54,591 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 05:25:54,599 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:54,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:54,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:54,599 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:54,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:54,634 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:54,634 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:54,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:54,634 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:54,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:54,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,659 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:54,659 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:25:54,660 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 05:25:54,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:54,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:54,810 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:54,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:25:54,810 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:54,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 05:25:54,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:54,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 05:25:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2022-12-06 05:25:54,810 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 05:25:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1027855010, now seen corresponding path program 1 times [2022-12-06 05:25:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:54,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151267205] [2022-12-06 05:25:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:54,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 05:25:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:54,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151267205] [2022-12-06 05:25:54,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151267205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:54,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:54,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:54,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721950195] [2022-12-06 05:25:54,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:54,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:54,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:54,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 05:25:54,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:54,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:55,180 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:55,180 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:55,188 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 05:25:55,196 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:55,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:55,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:55,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 05:25:55,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:55,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:55,232 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,232 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:55,232 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:55,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:55,232 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,232 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:55,233 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:55,233 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,264 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:55,265 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:25:55,266 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 05:25:55,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:55,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:55,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:25:55,412 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:55,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 05:25:55,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:55,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 05:25:55,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2022-12-06 05:25:55,413 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 05:25:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash 714955325, now seen corresponding path program 1 times [2022-12-06 05:25:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:55,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694741437] [2022-12-06 05:25:55,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:55,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:55,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 05:25:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:55,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694741437] [2022-12-06 05:25:55,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694741437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:55,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:55,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:55,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8186814] [2022-12-06 05:25:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:55,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:55,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:55,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:55,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 05:25:55,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:55,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:55,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:55,771 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:55,771 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:25:55,778 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 05:25:55,785 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:55,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:55,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:55,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 05:25:55,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:55,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:55,818 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,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 05:25:55,818 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:55,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:55,818 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:55,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:55,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,843 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:55,843 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:55,844 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 05:25:55,846 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:55,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:56,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:56,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:25:56,001 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:56,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:56,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:56,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:56,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2022-12-06 05:25:56,001 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 05:25:56,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1837201636, now seen corresponding path program 1 times [2022-12-06 05:25:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:56,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486826241] [2022-12-06 05:25:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:56,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 05:25:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:56,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486826241] [2022-12-06 05:25:56,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486826241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:56,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:56,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519773345] [2022-12-06 05:25:56,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:56,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:56,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:56,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:56,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 05:25:56,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:56,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:56,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:56,369 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:56,370 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:56,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:25:56,384 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:56,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:56,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:56,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 05:25:56,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:56,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 05:25:56,419 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,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 05:25:56,419 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:56,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:56,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,420 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:56,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:56,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,445 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:56,445 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:25:56,446 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 05:25:56,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:56,588 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:56,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:25:56,589 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:56,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:56,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:56,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:56,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2022-12-06 05:25:56,589 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 05:25:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash -94391301, now seen corresponding path program 1 times [2022-12-06 05:25:56,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:56,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392869540] [2022-12-06 05:25:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:56,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392869540] [2022-12-06 05:25:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392869540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:56,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300181073] [2022-12-06 05:25:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:56,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:56,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:56,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:56,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:56,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:56,936 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:56,936 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:56,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:56,950 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:56,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:56,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:56,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 05:25:56,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25: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 05:25:56,982 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,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 05:25:56,982 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:56,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:56,982 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:56,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:56,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:56,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,008 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:57,008 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:25:57,009 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 05:25:57,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:57,170 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:57,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:25:57,171 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:57,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:57,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:57,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:57,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2022-12-06 05:25:57,171 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 05:25:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1648419034, now seen corresponding path program 1 times [2022-12-06 05:25:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:57,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752937337] [2022-12-06 05:25:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:57,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 05:25:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:57,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752937337] [2022-12-06 05:25:57,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752937337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:57,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:57,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853385868] [2022-12-06 05:25:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:57,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:57,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:57,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:57,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 05:25:57,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:57,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:57,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:57,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:57,496 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:25:57,503 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 05:25:57,510 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:57,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:57,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:57,511 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:25:57,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:57,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:57,544 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:25:57,544 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:57,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:57,544 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:57,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:57,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,569 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:57,569 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:25:57,570 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 05:25:57,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:57,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:57,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:57,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:25:57,714 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:57,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:57,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:57,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:57,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2022-12-06 05:25:57,714 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 05:25:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -903737927, now seen corresponding path program 1 times [2022-12-06 05:25:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:57,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785089901] [2022-12-06 05:25:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:57,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785089901] [2022-12-06 05:25:57,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785089901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:57,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:57,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520048920] [2022-12-06 05:25:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:57,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:57,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:57,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:57,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:57,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:57,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:57,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:58,050 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:58,050 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:58,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 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 05:25:58,066 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:58,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:58,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:58,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 05:25:58,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:58,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 05:25:58,102 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,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 05:25:58,103 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:58,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:58,103 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:58,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:58,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,128 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:58,128 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:25:58,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 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 05:25:58,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:58,282 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:58,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:25:58,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:58,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 05:25:58,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:58,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 05:25:58,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2022-12-06 05:25:58,282 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 05:25:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 839072408, now seen corresponding path program 1 times [2022-12-06 05:25:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:58,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260772494] [2022-12-06 05:25:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:58,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 05:25:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:58,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260772494] [2022-12-06 05:25:58,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260772494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:58,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:58,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118277819] [2022-12-06 05:25:58,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:58,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:58,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:58,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 05:25:58,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:58,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:58,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:58,611 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:58,611 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:58,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 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 05:25:58,625 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:58,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:58,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:58,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 05:25:58,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:58,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 05:25:58,661 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,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 05:25:58,661 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:58,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:58,662 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:58,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:58,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,687 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:58,687 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:25:58,688 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 05:25:58,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:58,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:58,837 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:58,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:25:58,838 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:58,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:58,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:58,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:58,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2022-12-06 05:25:58,838 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 05:25:58,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1713084553, now seen corresponding path program 1 times [2022-12-06 05:25:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:58,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187388613] [2022-12-06 05:25:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:58,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 05:25:58,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:58,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187388613] [2022-12-06 05:25:58,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187388613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:58,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908097388] [2022-12-06 05:25:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:58,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:58,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:58,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 05:25:58,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:58,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:58,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:59,162 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:59,163 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:25:59,169 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 05:25:59,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:59,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:59,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:59,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 05:25:59,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:59,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 05:25:59,212 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,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 05:25:59,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:59,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:59,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:59,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:59,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,238 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:25:59,238 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:25:59,239 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 05:25:59,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:59,379 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:59,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:25:59,380 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:59,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:59,380 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:59,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:59,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2022-12-06 05:25:59,380 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 05:25:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash 29725782, now seen corresponding path program 1 times [2022-12-06 05:25:59,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:59,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634909957] [2022-12-06 05:25:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:59,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634909957] [2022-12-06 05:25:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634909957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:59,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:59,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:25:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315410068] [2022-12-06 05:25:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:59,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:25:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:25:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:25:59,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:25:59,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:59,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:59,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:25:59,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:59,728 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:25:59,728 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:25:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:25:59,773 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:25:59,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:25:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:25:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:25:59,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:25:59,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 05:25:59,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:25:59,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 05:25:59,802 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,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 05:25:59,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:25:59,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:59,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:59,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:59,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,827 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:25:59,827 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:25:59,828 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 05:25:59,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:25:59,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:25:59,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:59,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:25:59,983 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:25:59,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:59,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:59,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 05:25:59,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2022-12-06 05:25:59,984 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 05:25:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1772536117, now seen corresponding path program 1 times [2022-12-06 05:25:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:59,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667112090] [2022-12-06 05:25:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667112090] [2022-12-06 05:26:00,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667112090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859698639] [2022-12-06 05:26:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:00,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:00,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:00,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 05:26:00,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:00,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:00,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:00,327 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:00,334 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 05:26:00,342 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:00,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:00,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26: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 05:26:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:00,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:00,375 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,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 05:26:00,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:00,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:00,376 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:00,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:00,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,400 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:00,400 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:26:00,401 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 05:26:00,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:00,548 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:00,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:26:00,548 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:00,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 05:26:00,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:00,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:00,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2022-12-06 05:26:00,549 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 05:26:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash -779620844, now seen corresponding path program 1 times [2022-12-06 05:26:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:00,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767033242] [2022-12-06 05:26:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:00,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 05:26:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767033242] [2022-12-06 05:26:00,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767033242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:00,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:00,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632895841] [2022-12-06 05:26:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:00,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:00,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:00,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:00,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:00,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 05:26:00,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:00,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:00,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:00,893 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:00,893 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:00,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:00,907 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:00,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:00,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:00,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 05:26:00,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:00,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 05:26:00,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,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 05:26:00,940 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:00,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:00,940 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:00,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:00,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,966 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:00,966 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:26:00,967 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 05:26:00,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:00,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:01,118 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:01,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:26:01,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:01,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 05:26:01,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:01,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2022-12-06 05:26:01,119 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 05:26:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash 963189491, now seen corresponding path program 1 times [2022-12-06 05:26:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:01,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171005521] [2022-12-06 05:26:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171005521] [2022-12-06 05:26:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171005521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:01,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:01,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606328316] [2022-12-06 05:26:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:01,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:01,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 05:26:01,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:01,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:01,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:01,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:01,493 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:01,500 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 05:26:01,508 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:01,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:01,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:01,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 05:26:01,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:01,538 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:01,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 05:26:01,538 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:01,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:01,539 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:01,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:01,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:01,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:01,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:01,563 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:01,563 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:01,564 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 05:26:01,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:01,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:01,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:01,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 05:26:01,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:01,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 05:26:01,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:01,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:01,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2022-12-06 05:26:01,735 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 05:26:01,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:01,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1588967470, now seen corresponding path program 1 times [2022-12-06 05:26:01,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:01,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226207249] [2022-12-06 05:26:01,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:01,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:01,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 05:26:01,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:01,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226207249] [2022-12-06 05:26:01,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226207249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:01,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41209992] [2022-12-06 05:26:01,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:01,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:01,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:01,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:01,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:01,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 05:26:01,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:01,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:01,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:02,080 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:02,080 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:02,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:02,095 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:02,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:02,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:02,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 05:26:02,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:02,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 05:26:02,128 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,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 05:26:02,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:02,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:02,129 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:02,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:02,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,154 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:02,154 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:26:02,155 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 05:26:02,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:02,312 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:02,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:26:02,313 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:02,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 05:26:02,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:02,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 05:26:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2022-12-06 05:26:02,313 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 05:26:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash 153842865, now seen corresponding path program 1 times [2022-12-06 05:26:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:02,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691829980] [2022-12-06 05:26:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:02,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691829980] [2022-12-06 05:26:02,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691829980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:02,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:02,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10743404] [2022-12-06 05:26:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:02,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:02,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:02,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:02,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:02,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:02,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:02,643 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:02,643 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:02,650 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 05:26:02,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:02,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:02,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:02,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 05:26:02,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:02,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 05:26:02,690 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,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 05:26:02,691 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:02,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:02,691 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:02,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:02,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,715 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:02,715 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:26:02,716 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 05:26:02,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:02,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:02,866 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:02,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:26:02,867 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:02,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 05:26:02,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:02,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 05:26:02,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2022-12-06 05:26:02,867 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 05:26:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1896653200, now seen corresponding path program 1 times [2022-12-06 05:26:02,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:02,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345068852] [2022-12-06 05:26:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:02,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 05:26:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:02,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345068852] [2022-12-06 05:26:02,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345068852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:02,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:02,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485182402] [2022-12-06 05:26:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:02,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:02,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:02,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 05:26:02,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:02,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:02,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:03,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:03,196 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:03,205 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 05:26:03,213 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:03,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:03,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:03,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 05:26:03,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:03,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 05:26:03,248 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:03,249 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:03,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:03,249 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:03,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:03,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,275 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:03,275 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:26:03,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 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 05:26:03,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:03,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:03,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:03,418 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:03,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:03,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:03,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 05:26:03,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2022-12-06 05:26:03,418 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 05:26:03,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:03,418 INFO L85 PathProgramCache]: Analyzing trace with hash -655503761, now seen corresponding path program 1 times [2022-12-06 05:26:03,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:03,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348980601] [2022-12-06 05:26:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:03,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 05:26:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:03,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348980601] [2022-12-06 05:26:03,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348980601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:03,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:03,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811333668] [2022-12-06 05:26:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:03,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:03,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:03,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:03,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 05:26:03,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:03,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:03,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:03,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:03,763 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:03,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 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 05:26:03,778 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:03,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:03,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:03,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 05:26:03,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:03,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 05:26:03,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,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 05:26:03,812 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:03,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:03,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:03,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:03,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,837 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:03,837 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:03,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 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 05:26:03,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:03,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:03,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:03,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:26:03,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:03,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 05:26:03,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:03,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 05:26:03,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2022-12-06 05:26:03,989 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 05:26:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1087306574, now seen corresponding path program 1 times [2022-12-06 05:26:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:03,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939315305] [2022-12-06 05:26:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:04,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939315305] [2022-12-06 05:26:04,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939315305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:04,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:04,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199955423] [2022-12-06 05:26:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:04,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:04,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:04,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:04,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:04,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:04,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:04,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:04,352 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:04,353 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:04,358 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 05:26:04,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:04,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:04,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:04,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 05:26:04,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:04,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 05:26:04,395 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,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 05:26:04,395 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:04,395 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:04,395 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:04,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:04,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,420 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:04,420 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:26:04,421 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 05:26:04,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:04,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:04,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:04,564 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:04,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 05:26:04,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:04,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 05:26:04,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2022-12-06 05:26:04,565 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 05:26:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1464850387, now seen corresponding path program 1 times [2022-12-06 05:26:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998415563] [2022-12-06 05:26:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998415563] [2022-12-06 05:26:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998415563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275420638] [2022-12-06 05:26:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:04,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:04,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:04,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:04,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 05:26:04,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:04,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:04,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:04,906 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:04,906 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:04,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 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 05:26:04,920 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:04,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:04,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:04,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 05:26:04,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:04,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 05:26:04,954 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:04,954 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:04,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:04,954 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:04,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:04,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,978 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:04,979 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:04,980 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 05:26:04,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:04,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:05,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:05,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:26:05,127 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:05,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 05:26:05,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:05,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 05:26:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2022-12-06 05:26:05,127 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 05:26:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 277959948, now seen corresponding path program 1 times [2022-12-06 05:26:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320151796] [2022-12-06 05:26:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:05,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:05,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320151796] [2022-12-06 05:26:05,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320151796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:05,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:05,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:05,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059838666] [2022-12-06 05:26:05,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:05,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:05,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:05,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 05:26:05,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:05,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:05,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:05,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:05,469 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:05,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:05,483 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:05,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:05,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:05,484 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:05,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:05,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:05,515 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:05,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 05:26:05,515 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:05,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:05,515 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:05,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:05,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:05,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:05,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:05,540 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:05,540 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:05,541 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 05:26:05,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:05,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:05,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:05,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:05,684 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:05,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 05:26:05,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:05,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 05:26:05,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2022-12-06 05:26:05,684 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 05:26:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2020770283, now seen corresponding path program 1 times [2022-12-06 05:26:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002720580] [2022-12-06 05:26:05,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:05,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002720580] [2022-12-06 05:26:05,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002720580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:05,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:05,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572586373] [2022-12-06 05:26:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:05,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:05,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:05,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:05,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:05,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:05,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:05,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:06,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:06,045 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:06,052 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 05:26:06,059 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:06,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:06,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:06,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 05:26:06,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:06,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 05:26:06,092 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,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 05:26:06,092 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:06,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:06,092 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:06,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:06,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,117 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:06,117 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:06,118 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 05:26:06,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:06,277 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:06,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:26:06,278 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:06,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 05:26:06,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:06,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 05:26:06,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2022-12-06 05:26:06,278 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 05:26:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash -531386678, now seen corresponding path program 1 times [2022-12-06 05:26:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:06,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681576208] [2022-12-06 05:26:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:06,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 05:26:06,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:06,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681576208] [2022-12-06 05:26:06,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681576208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:06,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:06,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100831252] [2022-12-06 05:26:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:06,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:06,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:06,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:06,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:06,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:06,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:06,670 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:06,670 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:06,677 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 05:26:06,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:06,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:06,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:06,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 05:26:06,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:06,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 05:26:06,718 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:06,719 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:06,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:06,719 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:06,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:06,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,750 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:06,750 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:26:06,752 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 05:26:06,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:06,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:06,951 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:06,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 05:26:06,951 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:06,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:06,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:06,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:06,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2022-12-06 05:26:06,952 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 05:26:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1211423657, now seen corresponding path program 1 times [2022-12-06 05:26:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:06,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353511072] [2022-12-06 05:26:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:07,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 05:26:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353511072] [2022-12-06 05:26:07,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353511072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:07,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:07,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894900167] [2022-12-06 05:26:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:07,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:07,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:07,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:07,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:07,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:07,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:07,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:07,365 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:07,365 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:26:07,372 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 05:26:07,380 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:07,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:07,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:07,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 05:26:07,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:07,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:07,442 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:07,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 05:26:07,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:07,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:07,442 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:07,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:07,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:07,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:07,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:07,467 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:07,467 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:07,468 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 05:26:07,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:07,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:07,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:07,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:26:07,624 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:07,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 05:26:07,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:07,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 05:26:07,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2022-12-06 05:26:07,624 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 05:26:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1340733304, now seen corresponding path program 1 times [2022-12-06 05:26:07,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:07,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968027767] [2022-12-06 05:26:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:07,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 05:26:07,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:07,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968027767] [2022-12-06 05:26:07,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968027767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:07,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:07,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:07,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205287069] [2022-12-06 05:26:07,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:07,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:07,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:07,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 05:26:07,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:07,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:07,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:07,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:07,962 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:07,968 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 05:26:07,975 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:07,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:07,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:07,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:07,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 05:26:07,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:08,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 05:26:08,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,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 05:26:08,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:08,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:08,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:08,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:08,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,034 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:08,034 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:08,035 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 05:26:08,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:08,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:08,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:26:08,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:08,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 05:26:08,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:08,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 05:26:08,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2022-12-06 05:26:08,190 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 05:26:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 402077031, now seen corresponding path program 1 times [2022-12-06 05:26:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:08,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017572509] [2022-12-06 05:26:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:08,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017572509] [2022-12-06 05:26:08,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017572509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:08,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:08,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:08,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315733524] [2022-12-06 05:26:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:08,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:08,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:08,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 05:26:08,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:08,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:08,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:08,541 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:08,541 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:08,549 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 05:26:08,556 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:08,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:08,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:08,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 05:26:08,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:08,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 05:26:08,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,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 05:26:08,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:08,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:08,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:08,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:08,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,616 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:08,616 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:08,617 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 05:26:08,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:08,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:08,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:08,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:26:08,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:08,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 05:26:08,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:08,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 05:26:08,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2022-12-06 05:26:08,776 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 05:26:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2144887366, now seen corresponding path program 1 times [2022-12-06 05:26:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:08,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598260649] [2022-12-06 05:26:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:08,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 05:26:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:08,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598260649] [2022-12-06 05:26:08,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598260649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:08,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:08,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407088865] [2022-12-06 05:26:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:08,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:08,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:08,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 05:26:08,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:08,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:08,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:09,138 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:09,138 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:26:09,145 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 05:26:09,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:09,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:09,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:09,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 05:26:09,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:09,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 05:26:09,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,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 05:26:09,184 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:09,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:09,184 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:09,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:09,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,208 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:09,208 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:09,209 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 05:26:09,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:09,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:09,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:26:09,358 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:09,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:09,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:09,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:09,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2022-12-06 05:26:09,358 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 05:26:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash -407269595, now seen corresponding path program 1 times [2022-12-06 05:26:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:09,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820626637] [2022-12-06 05:26:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:09,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 05:26:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820626637] [2022-12-06 05:26:09,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820626637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:09,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:09,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621836363] [2022-12-06 05:26:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:09,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:09,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:09,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 05:26:09,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:09,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:09,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:09,686 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:09,687 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:09,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 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 05:26:09,701 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:09,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:09,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:09,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 05:26:09,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:09,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 05:26:09,733 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:09,733 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:09,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:09,734 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:09,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:09,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,759 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:09,759 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:26:09,760 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 05:26:09,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:09,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:09,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:09,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:26:09,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:09,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 05:26:09,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:09,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:09,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2022-12-06 05:26:09,912 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 05:26:09,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1335540740, now seen corresponding path program 1 times [2022-12-06 05:26:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371822196] [2022-12-06 05:26:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:09,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 05:26:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371822196] [2022-12-06 05:26:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371822196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:09,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:09,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421014696] [2022-12-06 05:26:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:09,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:09,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:09,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:09,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:09,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 05:26:09,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:09,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:09,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:10,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:10,241 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:10,247 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 05:26:10,254 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:10,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:10,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:10,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 05:26:10,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:10,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 05:26:10,293 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,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 05:26:10,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:10,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:10,294 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:10,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:10,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,318 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:10,318 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:26:10,319 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 05:26:10,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:10,475 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:10,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:26:10,476 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:10,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 05:26:10,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:10,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 05:26:10,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2022-12-06 05:26:10,476 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 05:26:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1216616221, now seen corresponding path program 1 times [2022-12-06 05:26:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:10,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198585369] [2022-12-06 05:26:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:10,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 05:26:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198585369] [2022-12-06 05:26:10,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198585369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:10,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:10,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075852797] [2022-12-06 05:26:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:10,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:10,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:10,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:10,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 05:26:10,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:10,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:10,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:10,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:10,825 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:10,831 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 05:26:10,838 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:10,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:10,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:10,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 05:26:10,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:10,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 05:26:10,872 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,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 05:26:10,872 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:10,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:10,872 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:10,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:10,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,897 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:10,897 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:26:10,898 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 05:26:10,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:10,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:11,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:11,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:26:11,047 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:11,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 05:26:11,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:11,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 05:26:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2022-12-06 05:26:11,047 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 05:26:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash 526194114, now seen corresponding path program 1 times [2022-12-06 05:26:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:11,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634565360] [2022-12-06 05:26:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:11,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634565360] [2022-12-06 05:26:11,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634565360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:11,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:11,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873984841] [2022-12-06 05:26:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:11,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:11,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:11,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 05:26:11,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:11,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:11,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:11,380 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:11,380 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:11,388 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 05:26:11,395 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:11,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:11,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:11,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 05:26:11,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:11,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 05:26:11,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:11,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 05:26:11,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:11,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:11,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:11,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:11,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:11,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:11,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:11,454 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:11,454 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:11,455 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 05:26:11,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:11,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:11,615 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:11,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:26:11,616 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:11,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:11,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:11,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 05:26:11,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2022-12-06 05:26:11,616 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 05:26:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2025962847, now seen corresponding path program 1 times [2022-12-06 05:26:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820100284] [2022-12-06 05:26:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:11,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 05:26:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:11,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820100284] [2022-12-06 05:26:11,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820100284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:11,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:11,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748182024] [2022-12-06 05:26:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:11,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:11,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:11,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:11,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 05:26:11,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:11,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:11,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:11,984 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:11,985 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:11,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:11,997 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:11,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:11,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:11,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 05:26:11,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:12,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:12,029 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,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 05:26:12,029 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:12,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:12,029 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:12,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:12,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,056 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:12,056 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:12,058 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 05:26:12,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:12,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:12,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:26:12,207 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:12,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 05:26:12,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:12,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 05:26:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2022-12-06 05:26:12,207 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 05:26:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -283152512, now seen corresponding path program 1 times [2022-12-06 05:26:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810662937] [2022-12-06 05:26:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:12,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:12,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810662937] [2022-12-06 05:26:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810662937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172223228] [2022-12-06 05:26:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:12,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:12,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:12,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:12,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:12,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:12,530 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:12,531 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:12,537 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 05:26:12,544 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:12,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:12,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:12,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 05:26:12,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:12,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 05:26:12,576 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,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 05:26:12,576 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:12,576 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:12,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:12,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:12,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,601 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:12,601 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:26:12,602 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 05:26:12,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:12,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:12,749 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:12,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:26:12,750 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:12,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 05:26:12,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:12,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 05:26:12,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2022-12-06 05:26:12,750 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 05:26:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1459657823, now seen corresponding path program 1 times [2022-12-06 05:26:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:12,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816227212] [2022-12-06 05:26:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:12,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 05:26:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816227212] [2022-12-06 05:26:12,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816227212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:12,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:12,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887829405] [2022-12-06 05:26:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:12,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:12,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:12,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 05:26:12,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:12,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:12,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:13,080 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:13,080 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:13,087 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 05:26:13,094 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:13,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:13,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:13,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 05:26:13,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:13,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 05:26:13,128 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,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 05:26:13,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:13,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:13,129 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:13,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:13,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,153 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:13,154 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:13,155 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 05:26:13,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:13,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:13,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:26:13,307 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:13,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:13,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:13,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2022-12-06 05:26:13,307 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 05:26:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1092499138, now seen corresponding path program 1 times [2022-12-06 05:26:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:13,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100875202] [2022-12-06 05:26:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:13,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 05:26:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:13,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100875202] [2022-12-06 05:26:13,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100875202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:13,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:13,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:13,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208957601] [2022-12-06 05:26:13,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:13,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:13,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:13,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:13,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 05:26:13,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:13,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:13,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:13,652 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:13,653 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:13,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:13,667 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:13,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:13,667 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:13,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 05:26:13,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:13,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 05:26:13,700 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:13,700 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:13,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:13,700 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:13,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:13,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,725 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:13,726 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:26:13,727 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 05:26:13,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:13,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:13,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:13,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:26:13,872 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:13,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 05:26:13,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:13,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 05:26:13,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2022-12-06 05:26:13,872 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 05:26:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash 650311197, now seen corresponding path program 1 times [2022-12-06 05:26:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:13,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898387535] [2022-12-06 05:26:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:13,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 05:26:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:13,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898387535] [2022-12-06 05:26:13,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898387535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:13,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940865594] [2022-12-06 05:26:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:13,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:13,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:13,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:13,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 05:26:13,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:13,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:14,213 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:14,213 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:14,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 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 05:26:14,226 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:14,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:14,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:14,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 05:26:14,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:14,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:14,259 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,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 05:26:14,260 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:14,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:14,260 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:14,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:14,260 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,285 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:14,285 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:14,286 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 05:26:14,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:14,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:14,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:26:14,433 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:14,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:14,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:14,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 05:26:14,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2022-12-06 05:26:14,433 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 05:26:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1901845764, now seen corresponding path program 1 times [2022-12-06 05:26:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518021043] [2022-12-06 05:26:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:14,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 05:26:14,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:14,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518021043] [2022-12-06 05:26:14,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518021043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:14,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:14,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601726547] [2022-12-06 05:26:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:14,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:14,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:14,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:14,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:14,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 05:26:14,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:14,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:14,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:14,764 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:14,764 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:14,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 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 05:26:14,778 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:14,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:14,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:14,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 05:26:14,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:14,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 05:26:14,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,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 05:26:14,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:14,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:14,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:14,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:14,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,848 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:14,848 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:14,849 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 05:26:14,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:14,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:15,009 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:15,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:26:15,010 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:15,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:15,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:15,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:15,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2022-12-06 05:26:15,010 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 05:26:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -159035429, now seen corresponding path program 1 times [2022-12-06 05:26:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:15,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885232843] [2022-12-06 05:26:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:15,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:15,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885232843] [2022-12-06 05:26:15,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885232843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:15,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:15,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725246760] [2022-12-06 05:26:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:15,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:15,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:15,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:15,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:15,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:15,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:15,349 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:15,349 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:15,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 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 05:26:15,363 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:15,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:15,364 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:15,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 05:26:15,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:15,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:15,398 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:15,398 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:15,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:15,398 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:15,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:15,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,423 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:15,423 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:26:15,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 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 05:26:15,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:15,575 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:15,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:26:15,575 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:15,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:15,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:15,575 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:15,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2022-12-06 05:26:15,576 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 05:26:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1583774906, now seen corresponding path program 1 times [2022-12-06 05:26:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:15,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619263138] [2022-12-06 05:26:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:15,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 05:26:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:15,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619263138] [2022-12-06 05:26:15,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619263138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:15,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:15,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943307240] [2022-12-06 05:26:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:15,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:15,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:15,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:15,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 05:26:15,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:15,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:15,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:15,903 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:15,903 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:15,910 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 05:26:15,917 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:15,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:15,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:15,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 05:26:15,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:15,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 05:26:15,951 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:15,951 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:15,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:15,951 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:15,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:15,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,976 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:15,976 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:15,977 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 05:26:15,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:15,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:16,124 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:16,125 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:26:16,125 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:16,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:16,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:16,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:16,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2022-12-06 05:26:16,125 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 05:26:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -968382055, now seen corresponding path program 1 times [2022-12-06 05:26:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:16,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444595679] [2022-12-06 05:26:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:16,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:16,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 05:26:16,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:16,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444595679] [2022-12-06 05:26:16,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444595679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:16,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:16,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316155074] [2022-12-06 05:26:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:16,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:16,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:16,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 05:26:16,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:16,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:16,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:16,484 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:16,484 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:26:16,490 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 05:26:16,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:16,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:16,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:16,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 05:26:16,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:16,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:16,527 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:16,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 05:26:16,527 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:16,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:16,527 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:16,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:16,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:16,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:16,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:16,551 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:16,552 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:16,553 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 05:26:16,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:16,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:16,709 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:16,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:26:16,710 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:16,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 05:26:16,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:16,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 05:26:16,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2022-12-06 05:26:16,710 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 05:26:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash 774428280, now seen corresponding path program 1 times [2022-12-06 05:26:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:16,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432068218] [2022-12-06 05:26:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:16,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 05:26:16,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:16,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432068218] [2022-12-06 05:26:16,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432068218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:16,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:16,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463629536] [2022-12-06 05:26:16,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:16,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:16,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:16,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 05:26:16,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:16,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:16,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:17,049 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:17,049 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:17,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 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 05:26:17,063 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:17,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:17,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:17,064 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:17,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:17,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 05:26:17,095 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,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 05:26:17,095 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:17,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:17,095 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:17,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:17,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,120 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:17,120 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:26:17,121 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 05:26:17,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:17,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:17,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:26:17,293 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:17,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 05:26:17,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:17,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2022-12-06 05:26:17,294 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 05:26:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1777728681, now seen corresponding path program 1 times [2022-12-06 05:26:17,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:17,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089981972] [2022-12-06 05:26:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:17,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 05:26:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:17,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089981972] [2022-12-06 05:26:17,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089981972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:17,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:17,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937157059] [2022-12-06 05:26:17,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:17,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:17,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:17,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:17,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 05:26:17,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:17,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:17,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:17,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:17,632 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:17,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 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 05:26:17,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:17,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:17,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:17,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 05:26:17,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:17,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 05:26:17,680 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,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 05:26:17,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:17,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:17,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:17,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:17,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,705 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:17,706 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:26:17,707 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 05:26:17,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:17,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:17,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:17,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:26:17,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:17,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:17,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:17,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:17,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2022-12-06 05:26:17,857 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 05:26:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -34918346, now seen corresponding path program 1 times [2022-12-06 05:26:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:17,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175678249] [2022-12-06 05:26:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:17,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 05:26:17,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:17,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175678249] [2022-12-06 05:26:17,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175678249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:17,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:17,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910601257] [2022-12-06 05:26:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:17,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:17,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:17,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:17,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 05:26:17,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:17,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:17,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:18,186 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:18,186 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:18,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:18,200 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:18,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:18,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:18,201 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:18,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:18,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 05:26:18,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,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 05:26:18,233 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:18,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:18,233 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:18,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:18,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,258 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:18,258 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:26:18,259 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 05:26:18,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:18,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:18,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:26:18,416 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:18,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 05:26:18,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:18,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 05:26:18,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2022-12-06 05:26:18,417 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 05:26:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1707891989, now seen corresponding path program 1 times [2022-12-06 05:26:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:18,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029732510] [2022-12-06 05:26:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:18,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029732510] [2022-12-06 05:26:18,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029732510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:18,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:18,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083886407] [2022-12-06 05:26:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:18,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:18,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:18,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:18,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:18,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:18,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:18,744 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:18,744 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:18,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 05:26:18,757 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:18,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:18,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:18,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 05:26:18,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:18,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 05:26:18,790 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,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 05:26:18,790 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:18,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:18,790 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:18,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:18,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,815 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:18,815 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:26:18,816 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 05:26:18,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:18,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:18,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:18,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:26:18,975 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:18,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 05:26:18,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:18,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 05:26:18,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2022-12-06 05:26:18,975 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 05:26:18,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -844264972, now seen corresponding path program 1 times [2022-12-06 05:26:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:18,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356542793] [2022-12-06 05:26:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:19,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 05:26:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:19,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356542793] [2022-12-06 05:26:19,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356542793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:19,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:19,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976813304] [2022-12-06 05:26:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:19,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:19,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:19,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 05:26:19,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:19,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:19,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:19,297 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:19,297 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:19,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:19,311 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:19,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:19,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:19,311 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:19,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:19,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:19,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,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 05:26:19,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:19,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:19,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,344 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:19,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:19,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,375 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:19,375 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:26:19,376 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 05:26:19,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:19,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:19,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:26:19,532 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:19,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 05:26:19,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:19,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 05:26:19,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2022-12-06 05:26:19,532 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 05:26:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 898545363, now seen corresponding path program 1 times [2022-12-06 05:26:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:19,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399152675] [2022-12-06 05:26:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:19,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:19,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399152675] [2022-12-06 05:26:19,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399152675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:19,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:19,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:19,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345620173] [2022-12-06 05:26:19,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:19,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:19,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:19,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:19,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:19,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:19,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:19,868 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:19,868 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:19,875 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 05:26:19,882 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:19,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:19,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:19,883 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:19,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:19,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 05:26:19,915 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:19,916 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:19,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:19,916 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,916 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:19,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:19,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,940 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:19,940 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:19,941 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 05:26:19,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:19,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:20,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:20,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:20,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:20,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 05:26:20,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:20,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 05:26:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2022-12-06 05:26:20,085 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 05:26:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1653611598, now seen corresponding path program 1 times [2022-12-06 05:26:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:20,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76214528] [2022-12-06 05:26:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:20,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 05:26:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:20,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76214528] [2022-12-06 05:26:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76214528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:20,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:20,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717762361] [2022-12-06 05:26:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:20,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:20,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:20,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 05:26:20,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:20,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:20,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:20,414 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:20,414 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:20,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 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 05:26:20,428 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:20,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:20,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:20,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 05:26:20,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:20,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 05:26:20,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:20,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 05:26:20,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:20,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:20,464 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:20,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:20,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:20,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:20,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:20,490 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:20,490 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:20,491 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 05:26:20,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:20,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:20,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:20,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:26:20,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:20,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 05:26:20,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:20,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 05:26:20,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2022-12-06 05:26:20,661 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 05:26:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash 89198737, now seen corresponding path program 1 times [2022-12-06 05:26:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70215485] [2022-12-06 05:26:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:20,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70215485] [2022-12-06 05:26:20,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70215485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:20,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:20,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703359288] [2022-12-06 05:26:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:20,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:20,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 05:26:20,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:21,006 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:21,006 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:26:21,013 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 05:26:21,020 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:21,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:21,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:21,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 05:26:21,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:21,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 05:26:21,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,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 05:26:21,052 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:21,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:21,052 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:21,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:21,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,076 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:21,077 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:21,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 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 05:26:21,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:21,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:21,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:26:21,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:21,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 05:26:21,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:21,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 05:26:21,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2022-12-06 05:26:21,243 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 05:26:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1832009072, now seen corresponding path program 1 times [2022-12-06 05:26:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:21,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793625435] [2022-12-06 05:26:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:21,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:21,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793625435] [2022-12-06 05:26:21,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793625435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:21,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:21,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:21,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995764895] [2022-12-06 05:26:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:21,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:21,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:21,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:21,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:21,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:21,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:21,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:21,609 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:21,609 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:21,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:21,624 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:21,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:21,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:21,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 05:26:21,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:21,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 05:26:21,658 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,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 05:26:21,659 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:21,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:21,659 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:21,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:21,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,689 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:21,689 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:21,690 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 05:26:21,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:21,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:21,835 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:21,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:26:21,836 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:21,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 05:26:21,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:21,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 05:26:21,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2022-12-06 05:26:21,836 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 05:26:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -720147889, now seen corresponding path program 1 times [2022-12-06 05:26:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:21,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5463672] [2022-12-06 05:26:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:21,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 05:26:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:21,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5463672] [2022-12-06 05:26:21,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5463672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:21,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:21,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687476044] [2022-12-06 05:26:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:21,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:21,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:21,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:21,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 05:26:21,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:21,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:21,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:22,166 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:22,167 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:22,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 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 05:26:22,181 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:22,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:22,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:22,182 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:22,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:22,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 05:26:22,216 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,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 05:26:22,216 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:22,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:22,216 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:22,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:22,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,241 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:22,241 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:22,242 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 05:26:22,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:22,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:22,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:26:22,393 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26: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 05:26:22,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26: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 05:26:22,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2022-12-06 05:26:22,394 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 05:26:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1022662446, now seen corresponding path program 1 times [2022-12-06 05:26:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:22,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47054621] [2022-12-06 05:26:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:22,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 05:26:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:22,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47054621] [2022-12-06 05:26:22,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47054621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:22,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:22,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:22,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298475792] [2022-12-06 05:26:22,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:22,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:22,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:22,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:22,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 05:26:22,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:22,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:22,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:22,738 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:22,739 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:22,745 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 05:26:22,752 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:22,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:22,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:22,753 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:22,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:22,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 05:26:22,787 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,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 05:26:22,787 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:22,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:22,787 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:22,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:22,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,812 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:22,812 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:26:22,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 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 05:26:22,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:22,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:22,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:22,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:22,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:22,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 05:26:22,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:22,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 05:26:22,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2022-12-06 05:26:22,956 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 05:26:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1529494515, now seen corresponding path program 1 times [2022-12-06 05:26:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:22,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546600220] [2022-12-06 05:26:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:23,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546600220] [2022-12-06 05:26:23,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546600220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:23,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:23,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273557271] [2022-12-06 05:26:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:23,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:23,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:23,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 05:26:23,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:23,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:23,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:23,306 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:23,306 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:23,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 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 05:26:23,320 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:23,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:23,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:23,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 05:26:23,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:23,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 05:26:23,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,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 05:26:23,353 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:23,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:23,353 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:23,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:23,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,378 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:23,378 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:26:23,379 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 05:26:23,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:23,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:23,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:26:23,527 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:23,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:23,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:23,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2022-12-06 05:26:23,527 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 05:26:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 213315820, now seen corresponding path program 1 times [2022-12-06 05:26:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:23,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548149140] [2022-12-06 05:26:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:23,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:23,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 05:26:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:23,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548149140] [2022-12-06 05:26:23,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548149140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:23,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:23,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504623127] [2022-12-06 05:26:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:23,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:23,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:23,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:23,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:23,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:23,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:23,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:23,886 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:23,886 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:23,892 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 05:26:23,897 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:23,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:23,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:23,898 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:23,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:23,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 05:26:23,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,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 05:26:23,925 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:23,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:23,925 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:23,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:23,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,950 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:23,950 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 05:26:23,952 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 05:26:23,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:23,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:24,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:24,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:26:24,114 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:24,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 05:26:24,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:24,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 05:26:24,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2022-12-06 05:26:24,114 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 05:26:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1956126155, now seen corresponding path program 1 times [2022-12-06 05:26:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:24,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030941681] [2022-12-06 05:26:24,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:24,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 05:26:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:24,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030941681] [2022-12-06 05:26:24,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030941681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:24,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:24,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955552493] [2022-12-06 05:26:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:24,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:24,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 05:26:24,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:24,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:24,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:24,441 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:24,441 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:24,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 05:26:24,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:24,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:24,456 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:24,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 05:26:24,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:24,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 05:26:24,490 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:24,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 05:26:24,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:24,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:24,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:24,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:24,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:24,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:24,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:24,515 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:24,515 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:24,516 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 05:26:24,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:24,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:24,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:24,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:26:24,675 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:24,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 05:26:24,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:24,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 05:26:24,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2022-12-06 05:26:24,675 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 05:26:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -596030806, now seen corresponding path program 1 times [2022-12-06 05:26:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:24,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394120167] [2022-12-06 05:26:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:24,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 05:26:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:24,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394120167] [2022-12-06 05:26:24,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394120167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:24,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:24,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128835151] [2022-12-06 05:26:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:24,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:24,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:24,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:24,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 05:26:24,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:24,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:24,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:25,009 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:25,009 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:25,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 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 05:26:25,023 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:25,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:25,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:25,023 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:25,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:25,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:25,056 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,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 05:26:25,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:25,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:25,056 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:25,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:25,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,080 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:25,081 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26: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 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 05:26:25,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:25,235 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:25,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:26:25,236 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:25,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 05:26:25,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:25,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 05:26:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2022-12-06 05:26:25,236 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 05:26:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1146779529, now seen corresponding path program 1 times [2022-12-06 05:26:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:25,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065116617] [2022-12-06 05:26:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:25,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 05:26:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:25,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065116617] [2022-12-06 05:26:25,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065116617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:25,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:25,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335817200] [2022-12-06 05:26:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:25,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:25,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:25,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 05:26:25,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:25,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:25,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:25,596 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:25,596 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:25,603 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 05:26:25,610 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:25,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:25,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:25,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 05:26:25,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:25,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 05:26:25,643 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,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 05:26:25,643 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:25,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:25,643 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:25,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:25,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,667 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:25,668 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:25,669 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 05:26:25,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:25,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:25,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:25,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:26:25,814 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:25,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 05:26:25,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:25,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 05:26:25,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2022-12-06 05:26:25,815 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 05:26:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1405377432, now seen corresponding path program 1 times [2022-12-06 05:26:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:25,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827230307] [2022-12-06 05:26:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:25,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 05:26:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:25,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827230307] [2022-12-06 05:26:25,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827230307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:25,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:25,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017189889] [2022-12-06 05:26:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:25,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:25,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:25,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:25,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 05:26:25,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:25,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:25,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:26,142 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:26,142 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:26,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 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 05:26:26,156 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:26,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:26,157 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:26,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 05:26:26,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:26,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 05:26:26,190 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,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 05:26:26,191 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:26,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:26,191 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:26,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:26,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,216 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:26,216 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:26:26,217 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 05:26:26,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:26,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:26,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:26:26,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:26,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 05:26:26,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:26,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 05:26:26,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2022-12-06 05:26:26,366 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 05:26:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash 337432903, now seen corresponding path program 1 times [2022-12-06 05:26:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:26,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360774059] [2022-12-06 05:26:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:26,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 05:26:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360774059] [2022-12-06 05:26:26,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360774059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:26,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:26,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253003918] [2022-12-06 05:26:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:26,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:26,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:26,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:26,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 05:26:26,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:26,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:26,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:26,714 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:26,714 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:26,721 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 05:26:26,729 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:26,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:26,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:26,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 05:26:26,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:26,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 05:26:26,764 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,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 05:26:26,764 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:26,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:26,764 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:26,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:26,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,789 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:26,789 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:26:26,790 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 05:26:26,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:26,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:26,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:26,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:26:26,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05: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 05:26:26,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05: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 05:26:26,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2022-12-06 05:26:26,950 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 05:26:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2080243238, now seen corresponding path program 1 times [2022-12-06 05:26:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:26,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773472394] [2022-12-06 05:26:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773472394] [2022-12-06 05:26:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773472394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:27,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:27,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076094032] [2022-12-06 05:26:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:27,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:27,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 05:26:27,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:27,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:27,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:27,288 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:27,288 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:27,295 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 05:26:27,302 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:27,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:27,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:27,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 05:26:27,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26: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 05:26:27,337 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26: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 05:26:27,337 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:27,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:27,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:27,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:27,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,362 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:27,362 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:27,363 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 05:26:27,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:27,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:27,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:26:27,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:27,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 05:26:27,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:27,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 05:26:27,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2022-12-06 05:26:27,510 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 05:26:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash -471913723, now seen corresponding path program 1 times [2022-12-06 05:26:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059536691] [2022-12-06 05:26:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:27,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 05:26:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059536691] [2022-12-06 05:26:27,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059536691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:27,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617921971] [2022-12-06 05:26:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:27,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:27,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:27,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:27,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:27,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:27,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:27,851 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:27,852 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:27,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:27,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:27,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:27,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:27,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 05:26:27,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:27,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 05:26:27,900 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,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 05:26:27,900 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:27,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:27,900 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:27,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:27,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,925 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:27,925 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:27,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 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 05:26:27,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:27,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:28,075 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:28,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:26:28,075 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:28,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 05:26:28,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:28,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 05:26:28,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2022-12-06 05:26:28,075 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 05:26:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1270896612, now seen corresponding path program 1 times [2022-12-06 05:26:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593769041] [2022-12-06 05:26:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:28,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:28,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593769041] [2022-12-06 05:26:28,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593769041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:28,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:28,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96132977] [2022-12-06 05:26:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:28,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:28,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:28,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:28,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:28,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:28,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:28,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:28,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:28,433 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:28,433 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:28,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:28,445 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:28,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:28,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:28,446 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:28,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 05:26:28,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:28,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 05:26:28,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:28,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:28,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:28,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:28,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:28,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:28,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:28,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:28,501 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:28,501 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:26:28,502 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 05:26:28,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:28,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:28,664 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:28,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:26:28,664 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:28,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 05:26:28,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:28,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 05:26:28,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2022-12-06 05:26:28,665 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 05:26:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1281260349, now seen corresponding path program 1 times [2022-12-06 05:26:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:28,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999054864] [2022-12-06 05:26:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:28,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:28,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999054864] [2022-12-06 05:26:28,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999054864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:28,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:28,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583955468] [2022-12-06 05:26:28,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:28,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:28,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:28,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:28,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:28,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:28,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:28,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:29,007 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:29,007 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:29,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:29,021 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:29,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:29,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:29,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 05:26:29,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:29,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 05:26:29,056 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,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 05:26:29,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:29,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:29,056 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:29,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:29,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,080 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:29,080 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:26:29,081 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 05:26:29,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:29,248 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:29,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:26:29,248 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:29,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:29,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:29,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 05:26:29,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2022-12-06 05:26:29,249 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 05:26:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash 461549986, now seen corresponding path program 1 times [2022-12-06 05:26:29,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:29,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244966957] [2022-12-06 05:26:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:29,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 05:26:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:29,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244966957] [2022-12-06 05:26:29,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244966957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:29,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:29,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949653226] [2022-12-06 05:26:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:29,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:29,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:29,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 05:26:29,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:29,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:29,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:29,596 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:29,603 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 05:26:29,610 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:29,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:29,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:29,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 05:26:29,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:29,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 05:26:29,644 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,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 05:26:29,644 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:29,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:29,644 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:29,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:29,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,669 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:29,669 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:26:29,670 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 05:26:29,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:29,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:29,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:29,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:26:29,826 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:29,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:29,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:29,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:29,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2022-12-06 05:26:29,826 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 05:26:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2090606975, now seen corresponding path program 1 times [2022-12-06 05:26:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:29,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104569421] [2022-12-06 05:26:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104569421] [2022-12-06 05:26:29,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104569421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:29,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:29,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474333399] [2022-12-06 05:26:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:29,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:29,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:29,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:29,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 05:26:29,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:29,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:29,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:30,174 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:30,174 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:30,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:30,188 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:30,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:30,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26: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 05:26:30,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:30,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 05:26:30,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,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 05:26:30,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:30,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:30,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:30,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:30,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,246 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:30,246 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:26:30,247 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 05:26:30,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:30,412 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:30,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:26:30,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:30,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 05:26:30,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:30,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 05:26:30,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2022-12-06 05:26:30,413 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 05:26:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash -347796640, now seen corresponding path program 1 times [2022-12-06 05:26:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015661548] [2022-12-06 05:26:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:30,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 05:26:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:30,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015661548] [2022-12-06 05:26:30,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015661548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:30,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:30,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611658407] [2022-12-06 05:26:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:30,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:30,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 05:26:30,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:30,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:30,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:30,757 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:30,757 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:30,763 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 05:26:30,770 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:30,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:30,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:30,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 05:26:30,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:30,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 05:26:30,802 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,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 05:26:30,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:30,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:30,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:30,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:30,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,827 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:30,827 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:26:30,828 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 05:26:30,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:30,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:30,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:30,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:26:30,984 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:30,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 05:26:30,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:30,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 05:26:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2022-12-06 05:26:30,984 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 05:26:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1395013695, now seen corresponding path program 1 times [2022-12-06 05:26:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:30,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425752923] [2022-12-06 05:26:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:31,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425752923] [2022-12-06 05:26:31,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425752923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:31,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:31,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386030212] [2022-12-06 05:26:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:31,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:31,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:31,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:31,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:31,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:31,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:31,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:31,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:31,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:31,341 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:31,341 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:31,347 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 05:26:31,353 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:31,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:31,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:31,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 05:26:31,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:31,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 05:26:31,382 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,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 05:26:31,383 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:31,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:31,383 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:31,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:31,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,408 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:31,408 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:26:31,409 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 05:26:31,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:31,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:31,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:31,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:31,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 05:26:31,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:31,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 05:26:31,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2022-12-06 05:26:31,552 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 05:26:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1157143266, now seen corresponding path program 1 times [2022-12-06 05:26:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:31,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199556577] [2022-12-06 05:26:31,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:31,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199556577] [2022-12-06 05:26:31,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199556577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:31,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:31,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925471915] [2022-12-06 05:26:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:31,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:31,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:31,623 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:31,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 05:26:31,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:31,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:31,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:31,896 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:31,896 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:31,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:31,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:31,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:31,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 05:26:31,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:31,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 05:26:31,944 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,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 05:26:31,944 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:31,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:31,944 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:31,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:31,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,968 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:31,969 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:26:31,970 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 05:26:31,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:31,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:32,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:32,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:32,113 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:32,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:32,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:32,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:32,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2022-12-06 05:26:32,113 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 05:26:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 585667069, now seen corresponding path program 1 times [2022-12-06 05:26:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:32,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455358129] [2022-12-06 05:26:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:32,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 05:26:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455358129] [2022-12-06 05:26:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455358129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:32,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:32,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318168538] [2022-12-06 05:26:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:32,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:32,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:32,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 05:26:32,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:32,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:32,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:32,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:32,446 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:32,453 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 05:26:32,460 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:32,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:32,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:32,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 05:26:32,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:32,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 05:26:32,495 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:32,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 05:26:32,495 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:32,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:32,495 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:32,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:32,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:32,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:32,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:32,519 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:32,519 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:32,521 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 05:26:32,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:32,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:32,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:32,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:26:32,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:32,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 05:26:32,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:32,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 05:26:32,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2022-12-06 05:26:32,679 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 05:26:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1966489892, now seen corresponding path program 1 times [2022-12-06 05:26:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:32,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163431853] [2022-12-06 05:26:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:32,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 05:26:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:32,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163431853] [2022-12-06 05:26:32,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163431853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:32,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:32,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590249640] [2022-12-06 05:26:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:32,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:32,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:32,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:32,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 05:26:32,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:32,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:32,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:33,016 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:33,016 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:33,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:33,030 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:33,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:33,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:33,031 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:33,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:33,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 05:26:33,065 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,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 05:26:33,065 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:33,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:33,065 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:33,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:33,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,090 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:33,090 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:26:33,091 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 05:26:33,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:33,237 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:33,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:26:33,238 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:33,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 05:26:33,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:33,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 05:26:33,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2022-12-06 05:26:33,238 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 05:26:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -223679557, now seen corresponding path program 1 times [2022-12-06 05:26:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:33,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590269446] [2022-12-06 05:26:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:33,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 05:26:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:33,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590269446] [2022-12-06 05:26:33,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590269446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:33,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:33,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089028681] [2022-12-06 05:26:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:33,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:33,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:33,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 05:26:33,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:33,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:33,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:33,565 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:33,565 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:33,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:33,578 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:33,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:33,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:33,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 05:26:33,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:33,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 05:26:33,614 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:33,615 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:33,615 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:33,615 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:33,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:33,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,639 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:33,639 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:33,640 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 05:26:33,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:33,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:33,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:33,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:26:33,780 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:33,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 05:26:33,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:33,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 05:26:33,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2022-12-06 05:26:33,780 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 05:26:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1519130778, now seen corresponding path program 1 times [2022-12-06 05:26:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:33,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054003012] [2022-12-06 05:26:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:33,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 05:26:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:33,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054003012] [2022-12-06 05:26:33,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054003012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:33,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:33,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:33,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285620578] [2022-12-06 05:26:33,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:33,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:33,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:33,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:33,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 05:26:33,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:33,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:33,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:34,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:34,134 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:34,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:34,148 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:34,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:34,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:34,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 05:26:34,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:34,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:34,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:34,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:34,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:34,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:34,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:34,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,206 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:34,206 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:34,207 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 05:26:34,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:34,375 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:34,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:26:34,375 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:34,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:34,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:34,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:34,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2022-12-06 05:26:34,376 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 05:26:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:34,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1033026183, now seen corresponding path program 1 times [2022-12-06 05:26:34,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:34,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617921227] [2022-12-06 05:26:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:34,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 05:26:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:34,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617921227] [2022-12-06 05:26:34,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617921227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:34,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:34,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588381792] [2022-12-06 05:26:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:34,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:34,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:34,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 05:26:34,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:34,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:34,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:34,721 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:34,721 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:26:34,728 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 05:26:34,736 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:34,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:34,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05: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 05:26:34,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:34,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 05:26:34,767 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,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 05:26:34,767 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:34,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:34,767 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:34,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:34,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,792 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:34,792 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:26:34,793 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 05:26:34,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:34,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:34,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:34,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:26:34,943 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:34,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 05:26:34,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:34,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 05:26:34,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2022-12-06 05:26:34,944 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 05:26:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 709784152, now seen corresponding path program 1 times [2022-12-06 05:26:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:34,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212274205] [2022-12-06 05:26:34,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:35,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 05:26:35,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:35,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212274205] [2022-12-06 05:26:35,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212274205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:35,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:35,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:35,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420232919] [2022-12-06 05:26:35,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:35,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:35,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:35,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:35,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:35,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:35,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 05:26:35,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:35,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:35,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:35,286 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:35,286 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:26:35,292 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 05:26:35,300 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:35,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:35,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:35,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 05:26:35,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:35,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 05:26:35,333 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:35,333 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:35,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:35,333 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:35,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:35,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,358 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:35,358 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:26:35,359 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 05:26:35,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:35,511 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:35,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:26:35,512 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:35,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 05:26:35,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:35,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 05:26:35,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2022-12-06 05:26:35,512 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 05:26:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1842372809, now seen corresponding path program 1 times [2022-12-06 05:26:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675872354] [2022-12-06 05:26:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:35,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:35,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 05:26:35,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:35,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675872354] [2022-12-06 05:26:35,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675872354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:35,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:35,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719522829] [2022-12-06 05:26:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:35,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:35,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:35,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 05:26:35,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:35,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:35,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:35,866 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:35,866 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:35,874 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 05:26:35,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:35,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:35,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:35,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 05:26:35,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:35,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 05:26:35,909 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,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 05:26:35,909 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:35,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:35,909 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:35,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:35,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,939 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:35,939 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:26:35,940 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 05:26:35,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:35,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:36,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:36,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:26:36,108 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:36,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:36,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:36,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:36,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2022-12-06 05:26:36,108 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 05:26:36,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash -99562474, now seen corresponding path program 1 times [2022-12-06 05:26:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:36,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838156357] [2022-12-06 05:26:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:36,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:36,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838156357] [2022-12-06 05:26:36,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838156357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:36,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:36,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130110023] [2022-12-06 05:26:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:36,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:36,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:36,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:36,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:36,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:36,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:36,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:36,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:36,504 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:36,504 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:36,514 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 05:26:36,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:36,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:36,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:36,524 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:36,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:36,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:36,572 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:36,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:36,573 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:36,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:36,573 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:36,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:36,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:36,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:36,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:36,606 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:36,606 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:36,608 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 05:26:36,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:36,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:36,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:36,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 05:26:36,778 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:36,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 05:26:36,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:36,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 05:26:36,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2022-12-06 05:26:36,779 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 05:26:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1643247861, now seen corresponding path program 1 times [2022-12-06 05:26:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:36,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615568987] [2022-12-06 05:26:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:36,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 05:26:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:36,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615568987] [2022-12-06 05:26:36,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615568987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:36,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:36,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:36,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606551363] [2022-12-06 05:26:36,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:36,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:36,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:36,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:36,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:36,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 05:26:36,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:36,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:36,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:37,115 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:37,116 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:37,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:37,130 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:37,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:37,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:37,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 05:26:37,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:37,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 05:26:37,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,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 05:26:37,165 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:37,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:37,165 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:37,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:37,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,190 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:37,190 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:37,191 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 05:26:37,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:37,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:37,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:26:37,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:37,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 05:26:37,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:37,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 05:26:37,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2022-12-06 05:26:37,340 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 05:26:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash -908909100, now seen corresponding path program 1 times [2022-12-06 05:26:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:37,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283850851] [2022-12-06 05:26:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:37,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 05:26:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:37,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283850851] [2022-12-06 05:26:37,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283850851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:37,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:37,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804027672] [2022-12-06 05:26:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:37,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:37,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:37,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 05:26:37,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:37,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:37,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:37,683 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:37,684 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:37,690 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 05:26:37,697 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:37,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:37,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:37,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 05:26:37,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:37,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:37,729 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,729 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:37,729 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:37,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:37,730 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:37,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:37,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,754 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:37,754 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:37,755 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 05:26:37,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:37,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:37,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:37,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 05:26:37,892 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:37,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 05:26:37,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:37,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 05:26:37,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2022-12-06 05:26:37,893 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 05:26:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash 833901235, now seen corresponding path program 1 times [2022-12-06 05:26:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:37,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842589777] [2022-12-06 05:26:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:37,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 05:26:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:37,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842589777] [2022-12-06 05:26:37,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842589777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:37,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:37,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:37,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010403268] [2022-12-06 05:26:37,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:37,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:37,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:37,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:37,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:37,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:37,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 05:26:37,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:37,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:37,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:38,214 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:38,214 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:38,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 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 05:26:38,228 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:38,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:38,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:38,229 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:38,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:38,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:38,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,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 05:26:38,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:38,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:38,262 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:38,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:38,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,287 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:38,287 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:26:38,288 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 05:26:38,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:38,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:38,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:26:38,440 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:38,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 05:26:38,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:38,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 05:26:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2022-12-06 05:26:38,440 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 05:26:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1718255726, now seen corresponding path program 1 times [2022-12-06 05:26:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15106413] [2022-12-06 05:26:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15106413] [2022-12-06 05:26:38,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15106413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:38,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:38,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038358423] [2022-12-06 05:26:38,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:38,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:38,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:38,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:38,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:38,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:38,790 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:38,790 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:38,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 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 05:26:38,804 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:38,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:38,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:38,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 05:26:38,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:38,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:38,865 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:38,866 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:38,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:38,866 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:38,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:38,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,891 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:38,891 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:38,892 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 05:26:38,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:38,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:39,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:39,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:26:39,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:39,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 05:26:39,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:39,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 05:26:39,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2022-12-06 05:26:39,053 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 05:26:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash 24554609, now seen corresponding path program 1 times [2022-12-06 05:26:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:39,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808390274] [2022-12-06 05:26:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:39,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 05:26:39,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:39,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808390274] [2022-12-06 05:26:39,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808390274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:39,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:39,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120344136] [2022-12-06 05:26:39,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:39,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:39,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:39,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:39,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 05:26:39,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:39,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:39,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:39,383 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:39,383 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:39,389 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 05:26:39,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:39,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:39,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:39,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 05:26:39,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:39,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 05:26:39,428 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,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 05:26:39,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:39,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:39,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:39,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:39,429 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,453 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:39,453 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:39,454 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 05:26:39,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:39,600 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:39,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:26:39,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:39,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 05:26:39,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:39,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 05:26:39,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2022-12-06 05:26:39,601 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 05:26:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1767364944, now seen corresponding path program 1 times [2022-12-06 05:26:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193378937] [2022-12-06 05:26:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:39,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 05:26:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193378937] [2022-12-06 05:26:39,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193378937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:39,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:39,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076487178] [2022-12-06 05:26:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:39,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:39,673 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:39,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 05:26:39,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:39,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:39,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:39,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:39,948 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:39,954 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 05:26:39,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:39,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:39,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:39,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 05:26:39,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:39,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 05:26:39,995 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,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 05:26:39,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:39,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:39,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:39,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:39,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,020 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:40,020 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:26:40,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 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 05:26:40,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:40,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:40,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:26:40,170 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:40,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 05:26:40,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:40,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 05:26:40,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2022-12-06 05:26:40,170 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 05:26:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash -784792017, now seen corresponding path program 1 times [2022-12-06 05:26:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:40,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893342381] [2022-12-06 05:26:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:40,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893342381] [2022-12-06 05:26:40,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893342381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:40,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:40,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130630886] [2022-12-06 05:26:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:40,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:40,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 05:26:40,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:40,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:40,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:40,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:40,502 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:40,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 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 05:26:40,516 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:40,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:40,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:40,516 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:40,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:40,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 05:26:40,548 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,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 05:26:40,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:40,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:40,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:40,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:40,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,573 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:40,573 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:40,574 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 05:26:40,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:40,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:40,746 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:40,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:26:40,746 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:40,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:40,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:40,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2022-12-06 05:26:40,746 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 05:26:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash 958018318, now seen corresponding path program 1 times [2022-12-06 05:26:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:40,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538315367] [2022-12-06 05:26:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:40,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 05:26:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:40,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538315367] [2022-12-06 05:26:40,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538315367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:40,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:40,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:40,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898415552] [2022-12-06 05:26:40,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:40,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:40,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:40,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 05:26:40,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:40,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:40,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:41,077 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:41,077 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:41,084 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 05:26:41,091 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:41,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:41,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:41,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 05:26:41,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:41,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 05:26:41,125 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,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 05:26:41,125 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:41,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:41,125 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:41,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:41,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,150 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:41,150 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:26:41,151 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 05:26:41,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:41,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:41,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:26:41,304 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:41,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:41,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:41,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:41,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2022-12-06 05:26:41,304 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 05:26:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1594138643, now seen corresponding path program 1 times [2022-12-06 05:26:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:41,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746766772] [2022-12-06 05:26:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:41,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 05:26:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:41,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746766772] [2022-12-06 05:26:41,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746766772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:41,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:41,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200058684] [2022-12-06 05:26:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:41,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:41,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:41,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 05:26:41,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:41,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:41,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:41,653 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:41,653 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:41,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:41,667 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:41,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:41,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:41,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 05:26:41,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:41,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 05:26:41,703 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,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 05:26:41,703 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:41,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:41,703 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:41,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:41,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,728 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:41,728 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:41,730 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 05:26:41,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:41,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:41,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:41,902 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:26:41,902 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:41,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:41,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:41,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:41,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2022-12-06 05:26:41,902 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 05:26:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash 148671692, now seen corresponding path program 1 times [2022-12-06 05:26:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:41,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674250061] [2022-12-06 05:26:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:41,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674250061] [2022-12-06 05:26:41,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674250061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:41,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:41,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80281885] [2022-12-06 05:26:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:41,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:41,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:41,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:41,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:41,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:42,237 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:42,238 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:42,244 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 05:26:42,252 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:42,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:42,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:42,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 05:26:42,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:42,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 05:26:42,285 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,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 05:26:42,285 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:42,285 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:42,285 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,286 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:42,286 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:42,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,310 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:42,310 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:26:42,311 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 05:26:42,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:42,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:42,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:26:42,465 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:42,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 05:26:42,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:42,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 05:26:42,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2022-12-06 05:26:42,465 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 05:26:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1891482027, now seen corresponding path program 1 times [2022-12-06 05:26:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717123379] [2022-12-06 05:26:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:42,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 05:26:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:42,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717123379] [2022-12-06 05:26:42,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717123379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:42,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:42,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089380215] [2022-12-06 05:26:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:42,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:42,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 05:26:42,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:42,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:42,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:42,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:42,796 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:26:42,803 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 05:26:42,810 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:42,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:42,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:42,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:42,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:42,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:42,841 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:42,841 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:42,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:42,841 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:42,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:42,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,866 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:42,866 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:26:42,867 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 05:26:42,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:42,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:43,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:43,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:26:43,011 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:43,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 05:26:43,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:43,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 05:26:43,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2022-12-06 05:26:43,011 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 05:26:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -660674934, now seen corresponding path program 1 times [2022-12-06 05:26:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:43,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466643921] [2022-12-06 05:26:43,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:43,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 05:26:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466643921] [2022-12-06 05:26:43,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466643921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:43,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:43,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400593178] [2022-12-06 05:26:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:43,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:43,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:43,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 05:26:43,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:43,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:43,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:43,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:43,374 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:43,380 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 05:26:43,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:43,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:43,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:43,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 05:26:43,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:43,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:43,415 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,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 05:26:43,415 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:43,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:43,415 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:43,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:43,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,440 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:43,440 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:43,441 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 05:26:43,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:43,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:43,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:26:43,584 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:43,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 05:26:43,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:43,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 05:26:43,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2022-12-06 05:26:43,585 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 05:26:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1082135401, now seen corresponding path program 1 times [2022-12-06 05:26:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:43,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725268009] [2022-12-06 05:26:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:43,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 05:26:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725268009] [2022-12-06 05:26:43,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725268009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:43,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:43,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440971477] [2022-12-06 05:26:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:43,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:43,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:43,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:43,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 05:26:43,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:43,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:43,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:43,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:43,912 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:43,918 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 05:26:43,925 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:43,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:43,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:43,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 05:26:43,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:43,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 05:26:43,958 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,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 05:26:43,958 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:43,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:43,959 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:43,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:43,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:43,983 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:26:43,984 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 05:26:43,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:43,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:44,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:44,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:26:44,140 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:44,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 05:26:44,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:44,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 05:26:44,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2022-12-06 05:26:44,141 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 05:26:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1470021560, now seen corresponding path program 1 times [2022-12-06 05:26:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976206550] [2022-12-06 05:26:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:44,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 05:26:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:44,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976206550] [2022-12-06 05:26:44,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976206550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:44,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:44,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383248527] [2022-12-06 05:26:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:44,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:44,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:44,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:44,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:44,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 05:26:44,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:44,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:44,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:44,485 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:44,485 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:26:44,492 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 05:26:44,499 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:44,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:44,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:44,500 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:44,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:44,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 05:26:44,536 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:44,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:44,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:44,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:44,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:44,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:44,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:44,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:44,561 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:44,562 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 05:26:44,563 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 05:26:44,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:44,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:44,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:44,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:26:44,714 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:44,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:44,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:44,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:44,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2022-12-06 05:26:44,714 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 05:26:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 272788775, now seen corresponding path program 1 times [2022-12-06 05:26:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:44,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728959373] [2022-12-06 05:26:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:44,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 05:26:44,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:44,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728959373] [2022-12-06 05:26:44,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728959373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:44,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:44,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060997204] [2022-12-06 05:26:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:44,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:44,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:44,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 05:26:44,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:44,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:44,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:45,073 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:45,073 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:26:45,080 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 05:26:45,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:45,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:45,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:45,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 05:26:45,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:45,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 05:26:45,121 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,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 05:26:45,122 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:45,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:45,122 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:45,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:45,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,146 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:45,146 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:26:45,147 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 05:26:45,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:45,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:45,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:26:45,306 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:45,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 05:26:45,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:45,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 05:26:45,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2022-12-06 05:26:45,306 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 05:26:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2015599110, now seen corresponding path program 1 times [2022-12-06 05:26:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:45,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476434124] [2022-12-06 05:26:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:45,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476434124] [2022-12-06 05:26:45,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476434124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:45,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946064573] [2022-12-06 05:26:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:45,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:45,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:45,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:45,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:45,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:45,646 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:45,646 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:26:45,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 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 05:26:45,659 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:45,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:45,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:45,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 05:26:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:45,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 05:26:45,692 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:45,692 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:45,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:45,692 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:45,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:45,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,717 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:45,717 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:26:45,718 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 05:26:45,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:45,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:45,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:45,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:26:45,869 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:45,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 05:26:45,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:45,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 05:26:45,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2022-12-06 05:26:45,869 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 05:26:45,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash -536557851, now seen corresponding path program 1 times [2022-12-06 05:26:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:45,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895128520] [2022-12-06 05:26:45,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:45,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:45,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 05:26:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895128520] [2022-12-06 05:26:45,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895128520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:45,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:45,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000168483] [2022-12-06 05:26:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:45,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:45,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:45,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:45,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 05:26:45,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:45,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:45,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:46,212 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:46,212 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:46,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 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 05:26:46,226 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:46,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:46,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:46,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 05:26:46,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:46,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 05:26:46,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,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 05:26:46,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:46,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:46,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:46,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:46,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,296 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:46,296 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:46,297 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 05:26:46,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:46,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:46,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:26:46,449 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26: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 05:26:46,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26: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 05:26:46,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2022-12-06 05:26:46,449 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 05:26:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1206252484, now seen corresponding path program 1 times [2022-12-06 05:26:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:46,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876284933] [2022-12-06 05:26:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:46,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 05:26:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876284933] [2022-12-06 05:26:46,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876284933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:46,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:46,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103357874] [2022-12-06 05:26:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:46,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:46,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:46,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 05:26:46,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:46,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:46,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:46,765 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:46,766 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:46,772 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 05:26:46,780 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:46,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:46,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:46,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 05:26:46,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:46,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 05:26:46,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,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 05:26:46,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:46,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:46,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,813 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:46,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:46,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,837 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:46,838 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:46,839 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 05:26:46,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:46,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:46,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:46,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:26:46,996 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:46,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 05:26:46,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:46,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 05:26:46,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2022-12-06 05:26:46,997 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 05:26:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1345904477, now seen corresponding path program 1 times [2022-12-06 05:26:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:46,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497540536] [2022-12-06 05:26:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497540536] [2022-12-06 05:26:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497540536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:47,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:47,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180397469] [2022-12-06 05:26:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:47,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:47,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:47,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 05:26:47,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:47,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:47,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:47,328 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:47,329 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:47,336 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 05:26:47,343 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:47,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:47,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:47,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 05:26:47,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:47,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 05:26:47,378 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,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 05:26:47,378 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:47,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:47,378 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:47,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:47,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,402 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:47,403 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:26:47,403 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 05:26:47,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:47,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:47,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:26:47,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:47,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 05:26:47,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:47,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 05:26:47,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2022-12-06 05:26:47,557 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 05:26:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 396905858, now seen corresponding path program 1 times [2022-12-06 05:26:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:47,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212107353] [2022-12-06 05:26:47,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:47,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 05:26:47,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212107353] [2022-12-06 05:26:47,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212107353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:47,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:47,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101894358] [2022-12-06 05:26:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:47,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:47,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:47,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:47,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:47,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:47,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:47,905 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:47,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 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 05:26:47,917 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:47,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:47,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:47,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 05:26:47,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:47,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 05:26:47,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,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 05:26:47,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:47,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:47,947 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:47,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:47,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,971 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:47,971 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:26:47,972 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 05:26:47,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:47,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:48,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:48,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:26:48,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:48,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 05:26:48,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:48,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 05:26:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2022-12-06 05:26:48,131 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 05:26:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:48,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2139716193, now seen corresponding path program 1 times [2022-12-06 05:26:48,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:48,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704165038] [2022-12-06 05:26:48,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704165038] [2022-12-06 05:26:48,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704165038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:48,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:48,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453009173] [2022-12-06 05:26:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:48,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:48,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 05:26:48,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:48,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:48,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:48,477 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:48,478 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:48,484 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 05:26:48,491 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:48,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:48,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:48,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 05:26:48,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:48,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 05:26:48,523 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:48,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 05:26:48,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:48,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:48,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:48,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:48,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:48,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:48,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:48,548 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:48,548 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:48,549 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 05:26:48,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:48,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:48,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:48,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:26:48,694 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:48,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:48,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:48,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:48,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2022-12-06 05:26:48,694 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 05:26:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -412440768, now seen corresponding path program 1 times [2022-12-06 05:26:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:48,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380304311] [2022-12-06 05:26:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380304311] [2022-12-06 05:26:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380304311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:48,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026669833] [2022-12-06 05:26:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:48,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:48,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:48,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:48,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:48,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:48,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:49,041 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:49,041 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:26:49,048 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 05:26:49,056 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:49,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:49,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:49,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 05:26:49,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:49,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 05:26:49,092 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,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 05:26:49,092 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:49,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:49,092 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:49,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:49,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,117 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:49,117 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:26:49,118 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 05:26:49,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:49,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:49,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:26:49,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:49,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 05:26:49,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:49,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 05:26:49,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2022-12-06 05:26:49,282 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 05:26:49,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1330369567, now seen corresponding path program 1 times [2022-12-06 05:26:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:49,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196357349] [2022-12-06 05:26:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:49,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 05:26:49,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:49,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196357349] [2022-12-06 05:26:49,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196357349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:49,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:49,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676372535] [2022-12-06 05:26:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:49,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:49,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:49,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:49,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 05:26:49,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:49,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:49,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:49,640 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:49,641 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:26:49,647 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 05:26:49,655 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:49,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:49,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:49,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 05:26:49,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:49,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 05:26:49,689 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,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 05:26:49,689 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:49,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:49,689 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:49,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:49,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,714 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:49,714 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 05:26:49,715 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 05:26:49,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:49,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:49,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:49,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 05:26:49,895 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:49,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 05:26:49,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:49,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 05:26:49,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2022-12-06 05:26:49,895 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 05:26:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1221787394, now seen corresponding path program 1 times [2022-12-06 05:26:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:49,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321936489] [2022-12-06 05:26:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:49,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 05:26:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321936489] [2022-12-06 05:26:49,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321936489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:49,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703957347] [2022-12-06 05:26:49,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:49,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:49,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:49,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 05:26:49,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:49,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:49,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:50,226 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:50,226 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:26:50,232 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 05:26:50,240 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:50,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:50,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:50,240 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:50,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 05:26:50,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,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 05:26:50,274 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:50,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:50,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:50,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:50,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,298 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:50,298 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:26:50,300 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 05:26:50,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:50,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:50,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:26:50,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:50,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 05:26:50,467 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:50,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 05:26:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2022-12-06 05:26:50,467 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 05:26:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash 521022941, now seen corresponding path program 1 times [2022-12-06 05:26:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:50,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434022128] [2022-12-06 05:26:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434022128] [2022-12-06 05:26:50,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434022128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:50,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438939846] [2022-12-06 05:26:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:50,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:50,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:50,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 05:26:50,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:50,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:50,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:50,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:50,840 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:50,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 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 05:26:50,851 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:50,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:50,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:50,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 05:26:50,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:50,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 05:26:50,881 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:50,881 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:50,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:50,881 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:50,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:50,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,906 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:50,906 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:50,907 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 05:26:50,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:50,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:51,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:51,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:26:51,079 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:51,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:51,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:51,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:51,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2022-12-06 05:26:51,079 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 05:26:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2031134020, now seen corresponding path program 1 times [2022-12-06 05:26:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:51,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457144646] [2022-12-06 05:26:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:51,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 05:26:51,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:51,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457144646] [2022-12-06 05:26:51,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457144646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:51,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:51,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000480767] [2022-12-06 05:26:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:51,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:51,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:51,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:51,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 05:26:51,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:51,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:51,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:51,414 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:51,414 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:51,421 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 05:26:51,428 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:51,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:51,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:51,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 05:26:51,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:51,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 05:26:51,461 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:51,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 05:26:51,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:51,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:51,462 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:51,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:51,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:51,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:51,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:51,486 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:51,486 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:26:51,487 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 05:26:51,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:51,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:51,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:51,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:26:51,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26: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 05:26:51,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26: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 05:26:51,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2022-12-06 05:26:51,643 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 05:26:51,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash -288323685, now seen corresponding path program 1 times [2022-12-06 05:26:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:51,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302163862] [2022-12-06 05:26:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:51,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 05:26:51,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:51,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302163862] [2022-12-06 05:26:51,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302163862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:51,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:51,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45908228] [2022-12-06 05:26:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:51,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:51,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:51,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:51,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:51,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 05:26:51,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:51,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:51,993 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:51,993 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:26:52,000 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 05:26:52,007 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:52,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:52,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:52,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 05:26:52,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:52,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 05:26:52,040 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,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 05:26:52,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:52,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:52,040 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,041 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:52,041 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:52,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,065 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:52,065 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:52,066 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 05:26:52,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:52,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:52,216 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:26:52,216 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:52,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:52,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:52,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:52,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2022-12-06 05:26:52,216 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 05:26:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1454486650, now seen corresponding path program 1 times [2022-12-06 05:26:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:52,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796552999] [2022-12-06 05:26:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:52,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 05:26:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:52,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796552999] [2022-12-06 05:26:52,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796552999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:52,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:52,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:52,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414186679] [2022-12-06 05:26:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:52,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:52,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:52,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 05:26:52,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:52,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:52,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:52,550 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:52,551 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:52,557 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 05:26:52,564 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:52,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:52,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:52,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 05:26:52,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:52,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 05:26:52,598 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:52,598 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:52,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:52,598 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:52,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:52,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,622 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:52,623 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:26:52,624 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 05:26:52,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:52,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:52,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:52,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:26:52,778 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:52,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 05:26:52,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:52,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 05:26:52,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2022-12-06 05:26:52,778 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 05:26:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1097670311, now seen corresponding path program 1 times [2022-12-06 05:26:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:52,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777833487] [2022-12-06 05:26:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:52,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 05:26:52,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777833487] [2022-12-06 05:26:52,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777833487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:52,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:52,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778930146] [2022-12-06 05:26:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:52,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:52,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:52,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 05:26:52,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:52,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:52,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:53,124 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:53,124 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:53,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 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 05:26:53,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:53,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:53,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:53,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 05:26:53,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:53,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 05:26:53,173 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,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 05:26:53,174 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:53,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:53,174 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:53,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:53,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,199 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:53,199 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:26:53,200 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 05:26:53,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:53,361 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:53,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:26:53,362 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:53,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:53,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:53,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:53,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2022-12-06 05:26:53,362 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 05:26:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 645140024, now seen corresponding path program 1 times [2022-12-06 05:26:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:53,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47849504] [2022-12-06 05:26:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26: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 05:26:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:53,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47849504] [2022-12-06 05:26:53,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47849504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:53,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:53,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602541125] [2022-12-06 05:26:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:53,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:53,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:53,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 05:26:53,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:53,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:53,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:53,704 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:53,704 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:26:53,711 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 05:26:53,718 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:53,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:53,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:53,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 05:26:53,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:53,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 05:26:53,750 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:53,750 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:53,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:53,750 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:53,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:53,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,785 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:53,785 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:26:53,786 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 05:26:53,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:53,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:53,960 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:53,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 05:26:53,960 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:53,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 05:26:53,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:53,960 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:53,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2022-12-06 05:26:53,961 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 05:26:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1907016937, now seen corresponding path program 1 times [2022-12-06 05:26:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:53,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230057045] [2022-12-06 05:26:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:54,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 05:26:54,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:54,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230057045] [2022-12-06 05:26:54,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230057045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:54,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:54,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934781520] [2022-12-06 05:26:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:54,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:54,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:54,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:54,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 05:26:54,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:54,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:54,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:54,311 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:54,312 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:54,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:54,326 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:54,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:54,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:54,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 05:26:54,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:54,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:54,359 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:54,359 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:54,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:54,359 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:54,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:54,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,384 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:54,384 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:26:54,385 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 05:26:54,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:54,534 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:54,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:26:54,535 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:54,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 05:26:54,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:54,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 05:26:54,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2022-12-06 05:26:54,535 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 05:26:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash -164206602, now seen corresponding path program 1 times [2022-12-06 05:26:54,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:54,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604953220] [2022-12-06 05:26:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:54,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604953220] [2022-12-06 05:26:54,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604953220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:54,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:54,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063756317] [2022-12-06 05:26:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:54,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:54,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:54,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:54,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:54,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:54,877 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:54,877 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:26:54,884 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 05:26:54,891 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:54,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:54,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:54,892 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:54,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:54,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 05:26:54,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,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 05:26:54,925 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:54,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:54,925 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:54,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:54,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,950 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:54,950 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:54,951 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 05:26:54,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:54,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:55,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:55,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:26:55,108 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:55,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:55,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:55,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:55,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2022-12-06 05:26:55,108 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 05:26:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1578603733, now seen corresponding path program 1 times [2022-12-06 05:26:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:55,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630876867] [2022-12-06 05:26:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:55,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 05:26:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:55,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630876867] [2022-12-06 05:26:55,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630876867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:55,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:55,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049270424] [2022-12-06 05:26:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:55,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:55,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 05:26:55,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:55,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:55,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:55,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:55,484 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:55,490 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 05:26:55,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:55,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:55,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:55,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 05:26:55,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:55,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 05:26:55,528 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:55,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 05:26:55,529 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:55,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:55,529 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:55,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:55,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:55,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:55,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:55,553 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:55,554 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:55,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 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 05:26:55,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:55,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:55,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:55,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:26:55,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:55,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 05:26:55,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:55,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 05:26:55,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2022-12-06 05:26:55,703 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 05:26:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -973553228, now seen corresponding path program 1 times [2022-12-06 05:26:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:55,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36271988] [2022-12-06 05:26:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:55,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36271988] [2022-12-06 05:26:55,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36271988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:55,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:55,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845855019] [2022-12-06 05:26:55,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:55,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:55,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:55,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:55,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:55,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:55,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:55,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:56,029 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:56,030 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:56,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:26:56,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:56,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:56,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:56,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 05:26:56,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:56,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:56,078 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:56,079 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:56,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:56,079 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:56,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:56,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,104 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:56,104 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:26:56,105 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 05:26:56,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:56,261 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:56,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:26:56,261 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:56,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 05:26:56,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:56,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:56,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2022-12-06 05:26:56,262 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 05:26:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash 769257107, now seen corresponding path program 1 times [2022-12-06 05:26:56,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:56,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056859161] [2022-12-06 05:26:56,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:56,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:56,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 05:26:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056859161] [2022-12-06 05:26:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056859161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:56,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:56,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014693946] [2022-12-06 05:26:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:56,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:56,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:56,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:56,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:56,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:56,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 05:26:56,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:56,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:56,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:56,587 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:56,588 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:56,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 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 05:26:56,602 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:56,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:56,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:56,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 05:26:56,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:56,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:56,634 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:56,634 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:56,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:56,634 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:56,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:56,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,659 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:56,659 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:26:56,660 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 05:26:56,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:56,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:56,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:56,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:26:56,813 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:56,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 05:26:56,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:56,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 05:26:56,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2022-12-06 05:26:56,814 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 05:26:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1782899854, now seen corresponding path program 1 times [2022-12-06 05:26:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312093524] [2022-12-06 05:26:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:56,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 05:26:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:56,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312093524] [2022-12-06 05:26:56,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312093524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:56,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:56,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060555409] [2022-12-06 05:26:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:56,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:56,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:56,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:56,904 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:56,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 05:26:56,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:56,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:56,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:57,209 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:57,209 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:57,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 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 05:26:57,223 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:57,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:57,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:57,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 05:26:57,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:57,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 05:26:57,255 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:57,256 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:57,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:57,256 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:57,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:57,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,280 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:57,280 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:26:57,281 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 05:26:57,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:57,436 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:57,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:26:57,436 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:57,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 05:26:57,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:57,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:57,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2022-12-06 05:26:57,437 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 05:26:57,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash -40089519, now seen corresponding path program 1 times [2022-12-06 05:26:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:57,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472858916] [2022-12-06 05:26:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:57,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472858916] [2022-12-06 05:26:57,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472858916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:57,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:57,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752662119] [2022-12-06 05:26:57,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:57,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:57,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:57,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:57,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:57,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:57,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:57,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:57,796 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:26:57,803 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 05:26:57,810 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:57,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:57,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:57,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:57,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:57,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:57,845 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:26:57,846 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:57,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:57,846 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:57,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:57,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,871 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:26:57,871 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:26:57,872 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 05:26:57,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:57,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:58,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:58,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:26:58,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:58,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 05:26:58,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:58,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 05:26:58,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2022-12-06 05:26:58,025 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 05:26:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1702720816, now seen corresponding path program 1 times [2022-12-06 05:26:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:58,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092617743] [2022-12-06 05:26:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092617743] [2022-12-06 05:26:58,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092617743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:58,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:58,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497807918] [2022-12-06 05:26:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:58,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:58,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:58,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:58,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:58,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:58,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:58,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:58,357 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:58,357 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:58,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:26:58,402 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:58,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:58,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:58,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 05:26:58,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:58,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 05:26:58,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:58,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 05:26:58,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:58,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:58,431 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:58,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:58,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:58,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:58,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:58,455 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:58,456 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:26:58,456 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 05:26:58,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:58,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:58,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:58,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:26:58,617 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:58,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 05:26:58,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:58,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 05:26:58,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2022-12-06 05:26:58,617 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 05:26:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -849436145, now seen corresponding path program 1 times [2022-12-06 05:26:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959494269] [2022-12-06 05:26:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:58,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 05:26:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959494269] [2022-12-06 05:26:58,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959494269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:58,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:58,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:58,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656842803] [2022-12-06 05:26:58,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:58,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:58,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:58,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 05:26:58,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:58,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:58,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:58,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:58,960 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:26:58,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 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 05:26:58,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:58,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:58,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:58,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 05:26:58,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26: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 05:26:59,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26: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 05:26:59,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:59,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:59,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:59,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:59,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,032 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:59,032 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:26:59,033 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 05:26:59,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:59,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:59,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:26:59,179 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:59,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:59,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:59,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2022-12-06 05:26:59,179 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 05:26:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash 893374190, now seen corresponding path program 1 times [2022-12-06 05:26:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:59,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584314791] [2022-12-06 05:26:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:59,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584314791] [2022-12-06 05:26:59,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584314791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:59,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:59,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:59,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641959652] [2022-12-06 05:26:59,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:59,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:59,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:59,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:59,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:59,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:59,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:59,526 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:26:59,526 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:26:59,533 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 05:26:59,541 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:26:59,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:26:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:26:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:26:59,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:26:59,542 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:26:59,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:26:59,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 05:26:59,575 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,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 05:26:59,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:26:59,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:59,575 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:59,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:59,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,600 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:26:59,600 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:26:59,601 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 05:26:59,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:26:59,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:26:59,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:26:59,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:26:59,759 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:26:59,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:26:59,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:59,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2022-12-06 05:26:59,759 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 05:26:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1658782771, now seen corresponding path program 1 times [2022-12-06 05:26:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:59,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190409268] [2022-12-06 05:26:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:59,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 05:26:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190409268] [2022-12-06 05:26:59,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190409268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:59,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:59,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:26:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551242493] [2022-12-06 05:26:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:26:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:59,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:26:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:26:59,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:26:59,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 05:26:59,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:59,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:26:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:00,095 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:00,095 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:00,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 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 05:27:00,108 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:00,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:00,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:00,109 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:00,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:00,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 05:27:00,141 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,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 05:27:00,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:00,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:00,141 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:00,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:00,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,166 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:00,166 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:00,167 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 05:27:00,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:00,312 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:00,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:27:00,312 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:00,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:00,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:00,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:00,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2022-12-06 05:27:00,312 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 05:27:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 84027564, now seen corresponding path program 1 times [2022-12-06 05:27:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:00,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22098481] [2022-12-06 05:27:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:00,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:00,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 05:27:00,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:00,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22098481] [2022-12-06 05:27:00,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22098481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:00,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:00,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698544825] [2022-12-06 05:27:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:00,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:00,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:00,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:00,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 05:27:00,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:00,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:00,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:00,655 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:00,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:00,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 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 05:27:00,670 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:00,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:00,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:00,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 05:27:00,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:00,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 05:27:00,703 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,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 05:27:00,703 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:00,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:00,703 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:00,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:00,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,728 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:00,728 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:27:00,729 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 05:27:00,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:00,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:00,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:00,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:27:00,878 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:00,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:00,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:00,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:00,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2022-12-06 05:27:00,878 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 05:27:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1826837899, now seen corresponding path program 1 times [2022-12-06 05:27:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:00,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599709167] [2022-12-06 05:27:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:00,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599709167] [2022-12-06 05:27:00,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599709167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:00,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:00,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019642501] [2022-12-06 05:27:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:00,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:00,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:00,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:00,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:00,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:01,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:01,219 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:01,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 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 05:27:01,234 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:01,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:01,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:01,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 05:27:01,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:01,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 05:27:01,268 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,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 05:27:01,268 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:01,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:01,268 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,269 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:01,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:01,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,293 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:01,293 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:27:01,305 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 05:27:01,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:01,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:01,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:27:01,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:01,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 05:27:01,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:01,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 05:27:01,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2022-12-06 05:27:01,457 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 05:27:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash -725319062, now seen corresponding path program 1 times [2022-12-06 05:27:01,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:01,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169575853] [2022-12-06 05:27:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:01,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:01,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 05:27:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:01,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169575853] [2022-12-06 05:27:01,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169575853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:01,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:01,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162632760] [2022-12-06 05:27:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:01,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:01,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 05:27:01,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:01,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:01,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:01,795 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:01,795 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:01,802 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 05:27:01,809 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:01,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:01,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:01,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 05:27:01,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:01,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:01,842 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,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 05:27:01,842 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:01,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:01,842 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:01,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:01,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,867 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:01,867 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 05:27:01,868 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 05:27:01,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:01,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:02,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:02,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:02,012 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:02,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 05:27:02,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:02,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:02,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2022-12-06 05:27:02,012 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 05:27:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1017491273, now seen corresponding path program 1 times [2022-12-06 05:27:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:02,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757556734] [2022-12-06 05:27:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:02,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 05:27:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:02,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757556734] [2022-12-06 05:27:02,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757556734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:02,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:02,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021694395] [2022-12-06 05:27:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:02,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:02,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:02,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 05:27:02,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:02,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:02,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:02,340 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:02,340 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:02,347 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 05:27:02,354 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:02,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:02,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:02,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 05:27:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:02,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 05:27:02,387 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,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 05:27:02,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:02,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:02,388 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:02,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:02,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,412 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:02,412 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:27:02,413 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 05:27:02,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:02,565 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:02,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:27:02,565 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:02,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 05:27:02,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:02,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 05:27:02,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2022-12-06 05:27:02,566 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 05:27:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1534665688, now seen corresponding path program 1 times [2022-12-06 05:27:02,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:02,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370984900] [2022-12-06 05:27:02,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:02,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 05:27:02,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:02,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370984900] [2022-12-06 05:27:02,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370984900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:02,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:02,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048747817] [2022-12-06 05:27:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:02,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:02,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:02,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:02,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:02,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 05:27:02,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:02,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:02,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:02,914 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:02,915 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:02,921 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 05:27:02,927 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:02,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:02,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:02,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 05:27:02,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:02,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 05:27:02,957 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,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 05:27:02,957 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:02,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:02,957 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:02,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:02,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,982 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:02,982 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:27:02,983 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 05:27:02,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:02,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:03,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:03,138 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:27:03,138 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:03,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 05:27:03,138 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:03,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 05:27:03,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2022-12-06 05:27:03,138 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 05:27:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:03,139 INFO L85 PathProgramCache]: Analyzing trace with hash 208144647, now seen corresponding path program 1 times [2022-12-06 05:27:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:03,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355778268] [2022-12-06 05:27:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:03,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 05:27:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:03,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355778268] [2022-12-06 05:27:03,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355778268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:03,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:03,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217658004] [2022-12-06 05:27:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:03,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:03,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:03,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:03,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:03,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:03,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:03,484 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:03,484 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:03,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:03,498 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:03,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:03,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:03,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 05:27:03,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:03,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 05:27:03,532 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:03,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 05:27:03,532 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:03,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:03,532 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:03,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:03,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:03,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:03,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:03,557 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:03,557 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:03,558 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 05:27:03,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:03,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:03,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:03,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:27:03,721 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:03,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 05:27:03,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:03,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 05:27:03,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2022-12-06 05:27:03,721 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 05:27:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1950954982, now seen corresponding path program 1 times [2022-12-06 05:27:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:03,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522847314] [2022-12-06 05:27:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:03,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522847314] [2022-12-06 05:27:03,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522847314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:03,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:03,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147355292] [2022-12-06 05:27:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:03,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:03,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:03,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:03,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 05:27:03,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:03,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:04,106 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:04,106 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:04,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:04,121 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:04,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:04,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:04,122 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:04,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:04,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 05:27:04,154 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,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 05:27:04,154 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:04,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:04,154 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:04,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:04,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,179 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:04,179 INFO L131 PetriNetUnfolder]: For 3297/3507 co-relation queries the response was YES. [2022-12-06 05:27:04,180 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 05:27:04,182 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,182 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:04,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:04,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:27:04,326 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:04,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:04,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:04,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:04,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2022-12-06 05:27:04,326 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 05:27:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash -601201979, now seen corresponding path program 1 times [2022-12-06 05:27:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:04,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544405156] [2022-12-06 05:27:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:04,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544405156] [2022-12-06 05:27:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544405156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:04,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:04,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:04,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834202592] [2022-12-06 05:27:04,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:04,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:04,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:04,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 05:27:04,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:04,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:04,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:04,687 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:04,687 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:27:04,694 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 05:27:04,701 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:04,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:04,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:04,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 05:27:04,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:04,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 05:27:04,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,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 05:27:04,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:04,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:04,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:04,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:04,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,761 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:04,761 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:04,762 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 05:27:04,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:04,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:04,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:04,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:27:04,915 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:04,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 05:27:04,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:04,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 05:27:04,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2022-12-06 05:27:04,915 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 05:27:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1141608356, now seen corresponding path program 1 times [2022-12-06 05:27:04,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:04,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793018099] [2022-12-06 05:27:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:04,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793018099] [2022-12-06 05:27:04,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793018099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:04,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:04,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799793241] [2022-12-06 05:27:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:04,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:04,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:04,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:04,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:04,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:04,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:04,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:05,239 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:05,239 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:05,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:05,253 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:05,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:05,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:05,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 05:27:05,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:05,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 05:27:05,286 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,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 05:27:05,287 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:05,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:05,287 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:05,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:05,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,311 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:05,312 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:27:05,313 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 05:27:05,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:05,457 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:05,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:27:05,458 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:05,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 05:27:05,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:05,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 05:27:05,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2022-12-06 05:27:05,458 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 05:27:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1410548605, now seen corresponding path program 1 times [2022-12-06 05:27:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:05,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821470317] [2022-12-06 05:27:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821470317] [2022-12-06 05:27:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821470317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:05,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:05,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463032278] [2022-12-06 05:27:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:05,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:05,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:05,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:05,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:05,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:05,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:05,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:05,797 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:05,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 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 05:27:05,842 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:05,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:05,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:05,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 05:27:05,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:05,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 05:27:05,871 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,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 05:27:05,871 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:05,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:05,871 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:05,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:05,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,896 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:05,896 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:05,897 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 05:27:05,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:05,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:06,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:06,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:27:06,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:06,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 05:27:06,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:06,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 05:27:06,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2022-12-06 05:27:06,052 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 05:27:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 332261730, now seen corresponding path program 1 times [2022-12-06 05:27:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:06,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577557081] [2022-12-06 05:27:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:06,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 05:27:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:06,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577557081] [2022-12-06 05:27:06,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577557081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:06,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:06,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964491396] [2022-12-06 05:27:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:06,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:06,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:06,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 05:27:06,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:06,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:06,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:06,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:06,410 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:27:06,417 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 05:27:06,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:06,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:06,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:06,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 05:27:06,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:06,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:06,457 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:06,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 05:27:06,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:06,458 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:06,458 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:06,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:06,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:06,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:06,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:06,482 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:06,483 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:27:06,484 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 05:27:06,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:06,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:06,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:06,645 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:27:06,645 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:06,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 05:27:06,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:06,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 05:27:06,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2022-12-06 05:27:06,645 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 05:27:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:06,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2075072065, now seen corresponding path program 1 times [2022-12-06 05:27:06,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:06,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798176706] [2022-12-06 05:27:06,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:06,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798176706] [2022-12-06 05:27:06,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798176706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:06,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:06,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145080501] [2022-12-06 05:27:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:06,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:06,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:06,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:06,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:06,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:06,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:07,009 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:07,009 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:07,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 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 05:27:07,024 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:07,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:07,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:07,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 05:27:07,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:07,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 05:27:07,059 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,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 05:27:07,059 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:07,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:07,059 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:07,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:07,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,085 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:07,085 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:27:07,086 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 05:27:07,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:07,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:07,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:07,241 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:07,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 05:27:07,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:07,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 05:27:07,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2022-12-06 05:27:07,242 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 05:27:07,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash -477084896, now seen corresponding path program 1 times [2022-12-06 05:27:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:07,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763844866] [2022-12-06 05:27:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:07,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:07,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763844866] [2022-12-06 05:27:07,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763844866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:07,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:07,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:07,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291085247] [2022-12-06 05:27:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:07,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:07,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:07,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:07,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:07,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:07,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:07,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:07,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:07,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:07,580 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:07,580 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:07,586 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 05:27:07,592 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:07,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:07,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:07,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 05:27:07,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:07,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 05:27:07,623 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:07,623 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:07,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:07,624 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:07,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:07,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,648 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:07,648 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 05:27:07,649 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 05:27:07,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:07,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:07,796 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:07,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:27:07,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:07,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 05:27:07,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:07,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 05:27:07,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2022-12-06 05:27:07,797 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 05:27:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1265725439, now seen corresponding path program 1 times [2022-12-06 05:27:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:07,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83911232] [2022-12-06 05:27:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:07,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 05:27:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:07,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83911232] [2022-12-06 05:27:07,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83911232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:07,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:07,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185504097] [2022-12-06 05:27:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:07,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:07,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:07,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 05:27:07,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:07,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:07,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:08,121 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:08,121 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:08,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 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 05:27:08,135 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:08,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:08,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:08,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 05:27:08,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:08,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 05:27:08,168 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,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 05:27:08,168 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:08,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:08,169 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:08,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:08,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,193 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:08,193 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:08,194 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 05:27:08,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:08,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:08,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:27:08,336 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:08,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 05:27:08,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:08,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 05:27:08,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2022-12-06 05:27:08,336 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 05:27:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1286431522, now seen corresponding path program 1 times [2022-12-06 05:27:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:08,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931757177] [2022-12-06 05:27:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:08,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 05:27:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:08,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931757177] [2022-12-06 05:27:08,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931757177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:08,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:08,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143916152] [2022-12-06 05:27:08,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:08,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:08,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:08,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 05:27:08,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:08,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:08,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:08,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:08,684 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:08,691 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 05:27:08,698 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:08,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:08,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:08,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 05:27:08,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:08,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:08,732 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:08,732 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:08,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:08,732 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:08,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:08,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,758 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:08,758 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:08,759 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 05:27:08,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:08,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:08,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:08,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:27:08,910 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:08,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 05:27:08,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:08,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 05:27:08,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2022-12-06 05:27:08,910 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 05:27:08,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 456378813, now seen corresponding path program 1 times [2022-12-06 05:27:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:08,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462615444] [2022-12-06 05:27:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:08,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462615444] [2022-12-06 05:27:08,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462615444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:08,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:08,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791864004] [2022-12-06 05:27:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:08,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:08,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:08,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:08,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 05:27:08,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:08,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:08,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:09,251 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:09,251 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:09,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 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 05:27:09,266 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:09,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:09,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:09,266 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:09,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:09,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:09,300 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,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 05:27:09,300 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:09,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:09,300 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:09,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:09,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,324 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:09,325 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:09,326 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 05:27:09,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:09,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:09,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:27:09,464 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:09,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 05:27:09,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:09,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 05:27:09,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2022-12-06 05:27:09,465 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 05:27:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2095778148, now seen corresponding path program 1 times [2022-12-06 05:27:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338123200] [2022-12-06 05:27:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:09,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 05:27:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:09,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338123200] [2022-12-06 05:27:09,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338123200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:09,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:09,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136713856] [2022-12-06 05:27:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:09,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:09,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:09,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 05:27:09,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:09,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:09,797 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:09,797 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:09,804 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 05:27:09,811 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:09,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:09,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:09,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:09,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:09,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 05:27:09,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,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 05:27:09,844 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:09,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:09,844 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:09,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:09,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,869 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:09,869 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:27:09,870 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 05:27:09,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:09,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:10,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:10,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:10,026 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:10,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 05:27:10,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:10,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 05:27:10,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2022-12-06 05:27:10,026 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 05:27:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -352967813, now seen corresponding path program 1 times [2022-12-06 05:27:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:10,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535262701] [2022-12-06 05:27:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27: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 05:27:10,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535262701] [2022-12-06 05:27:10,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535262701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:10,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:10,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042735819] [2022-12-06 05:27:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:10,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:10,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:10,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 05:27:10,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:10,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:10,397 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:10,397 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:10,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:10,409 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:10,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:10,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:10,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 05:27:10,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:10,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 05:27:10,439 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:10,439 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:10,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:10,439 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:10,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:10,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,464 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:10,464 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:27:10,465 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 05:27:10,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:10,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:10,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:27:10,605 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:10,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 05:27:10,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:10,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 05:27:10,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2022-12-06 05:27:10,605 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 05:27:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1389842522, now seen corresponding path program 1 times [2022-12-06 05:27:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:10,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601979949] [2022-12-06 05:27:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:10,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 05:27:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601979949] [2022-12-06 05:27:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601979949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:10,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:10,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347022213] [2022-12-06 05:27:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:10,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:10,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:10,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:10,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:10,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 05:27:10,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:10,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:10,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:10,937 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:10,938 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:10,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:10,952 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:10,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:10,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:10,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 05:27:10,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:10,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 05:27:10,986 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:10,986 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:10,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:10,987 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:10,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:10,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:10,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,011 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:11,011 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:27:11,012 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 05:27:11,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:11,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:11,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:11,168 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:11,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 05:27:11,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:11,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:11,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2022-12-06 05:27:11,169 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 05:27:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1162314439, now seen corresponding path program 1 times [2022-12-06 05:27:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:11,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735994328] [2022-12-06 05:27:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:11,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 05:27:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:11,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735994328] [2022-12-06 05:27:11,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735994328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:11,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:11,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861376158] [2022-12-06 05:27:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:11,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:11,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:11,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:11,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 05:27:11,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:11,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:11,520 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:11,520 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:11,526 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 05:27:11,533 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:11,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:11,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:11,534 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:11,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:11,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 05:27:11,569 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,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 05:27:11,569 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:11,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:11,569 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:11,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:11,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,594 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:11,594 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 05:27:11,595 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 05:27:11,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:11,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:11,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:11,739 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:11,739 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:11,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 05:27:11,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:11,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 05:27:11,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2022-12-06 05:27:11,739 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 05:27:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 580495896, now seen corresponding path program 1 times [2022-12-06 05:27:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995087389] [2022-12-06 05:27:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:11,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 05:27:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995087389] [2022-12-06 05:27:11,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995087389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:11,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:11,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573925178] [2022-12-06 05:27:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:11,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:11,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 05:27:11,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:11,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:11,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:12,085 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:12,085 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:12,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 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 05:27:12,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:12,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:12,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:12,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 05:27:12,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:12,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:12,130 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:12,130 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:12,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:12,130 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:12,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:12,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,155 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:12,155 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:27:12,156 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 05:27:12,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,158 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:12,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:12,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:27:12,301 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:12,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:12,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:12,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:12,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2022-12-06 05:27:12,302 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 05:27:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1971661065, now seen corresponding path program 1 times [2022-12-06 05:27:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:12,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166887123] [2022-12-06 05:27:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:12,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 05:27:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:12,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166887123] [2022-12-06 05:27:12,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166887123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:12,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:12,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644441665] [2022-12-06 05:27:12,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:12,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:12,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:12,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:12,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 05:27:12,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:12,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:12,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:12,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:12,622 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:27:12,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 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 05:27:12,635 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:12,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:12,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:12,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 05:27:12,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:12,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:12,669 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,669 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:12,669 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:12,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:12,669 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:12,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:12,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,694 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:12,694 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:12,695 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 05:27:12,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:12,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:12,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:12,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:27:12,842 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:12,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 05:27:12,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:12,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 05:27:12,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2022-12-06 05:27:12,842 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 05:27:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -228850730, now seen corresponding path program 1 times [2022-12-06 05:27:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:12,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531175248] [2022-12-06 05:27:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:12,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 05:27:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:12,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531175248] [2022-12-06 05:27:12,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531175248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:12,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:12,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954449914] [2022-12-06 05:27:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:12,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:12,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:12,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:12,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:12,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 05:27:12,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:12,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:12,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:13,166 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:13,166 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:13,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 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 05:27:13,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:13,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:13,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:13,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 05:27:13,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:13,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 05:27:13,214 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,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 05:27:13,214 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:13,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:13,214 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:13,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:13,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,248 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:13,248 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:13,249 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 05:27:13,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:13,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:13,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 05:27:13,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:13,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 05:27:13,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:13,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 05:27:13,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2022-12-06 05:27:13,413 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 05:27:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:13,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1513959605, now seen corresponding path program 1 times [2022-12-06 05:27:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:13,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886817233] [2022-12-06 05:27:13,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:13,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:13,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:13,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886817233] [2022-12-06 05:27:13,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886817233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:13,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:13,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:13,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147603930] [2022-12-06 05:27:13,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:13,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:13,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:13,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:13,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:13,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:13,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:13,746 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:13,746 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:13,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 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 05:27:13,759 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:13,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:13,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:13,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 05:27:13,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:13,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 05:27:13,793 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,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 05:27:13,793 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:13,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:13,793 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:13,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:13,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,818 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:13,818 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:13,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 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 05:27:13,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:13,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:13,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:13,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:27:13,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:13,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 05:27:13,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:13,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 05:27:13,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2022-12-06 05:27:13,966 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 05:27:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:13,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1038197356, now seen corresponding path program 1 times [2022-12-06 05:27:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:13,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249332340] [2022-12-06 05:27:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:13,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:14,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 05:27:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:14,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249332340] [2022-12-06 05:27:14,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249332340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:14,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:14,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895753045] [2022-12-06 05:27:14,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:14,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:14,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:14,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 05:27:14,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:14,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:14,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:14,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:14,307 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:27:14,314 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 05:27:14,322 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:14,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:14,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:14,322 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:14,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:14,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 05:27:14,354 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,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 05:27:14,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:14,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:14,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:14,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:14,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,379 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:14,379 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 05:27:14,380 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 05:27:14,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:14,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:14,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:27:14,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:14,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 05:27:14,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:14,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 05:27:14,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2022-12-06 05:27:14,570 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 05:27:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 704612979, now seen corresponding path program 1 times [2022-12-06 05:27:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:14,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843862184] [2022-12-06 05:27:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:14,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 05:27:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:14,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843862184] [2022-12-06 05:27:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843862184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:14,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620253309] [2022-12-06 05:27:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:14,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:14,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:14,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 05:27:14,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:14,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:14,939 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:14,939 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:14,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 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 05:27:14,953 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:14,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:14,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:14,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 05:27:14,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:14,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 05:27:14,983 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27: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 05:27:14,983 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:14,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:14,983 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:14,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:14,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:14,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,008 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:15,009 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:27:15,010 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 05:27:15,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:15,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:15,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:27:15,170 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:15,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 05:27:15,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:15,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 05:27:15,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2022-12-06 05:27:15,170 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 05:27:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1847543982, now seen corresponding path program 1 times [2022-12-06 05:27:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:15,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735698695] [2022-12-06 05:27:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735698695] [2022-12-06 05:27:15,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735698695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:15,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:15,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133172001] [2022-12-06 05:27:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:15,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:15,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:15,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 05:27:15,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:15,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:15,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:15,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:15,512 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:15,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 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 05:27:15,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:15,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:15,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:15,527 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:15,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:15,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 05:27:15,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,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 05:27:15,560 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:15,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:15,560 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:15,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:15,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,585 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:15,585 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:27:15,586 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 05:27:15,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:15,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:15,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:15,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:27:15,726 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:15,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 05:27:15,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:15,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 05:27:15,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2022-12-06 05:27:15,727 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 05:27:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -104733647, now seen corresponding path program 1 times [2022-12-06 05:27:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:15,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337218017] [2022-12-06 05:27:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:15,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:15,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337218017] [2022-12-06 05:27:15,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337218017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:15,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:15,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6272695] [2022-12-06 05:27:15,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:15,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:15,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:15,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:15,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:15,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:16,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:16,071 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:16,078 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 05:27:16,085 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:16,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:16,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:16,086 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:16,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:16,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 05:27:16,117 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,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 05:27:16,118 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:16,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:16,118 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:16,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:16,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,142 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:16,143 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:27:16,143 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 05:27:16,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:16,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:16,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:27:16,294 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:16,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:16,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:16,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:16,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2022-12-06 05:27:16,294 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 05:27:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1638076688, now seen corresponding path program 1 times [2022-12-06 05:27:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:16,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239166464] [2022-12-06 05:27:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:16,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 05:27:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:16,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239166464] [2022-12-06 05:27:16,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239166464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:16,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:16,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:16,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287966859] [2022-12-06 05:27:16,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:16,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:16,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:16,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:16,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:16,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 05:27:16,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:16,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:16,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:16,627 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:16,627 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:27:16,634 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 05:27:16,642 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:16,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:16,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:16,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 05:27:16,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:16,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 05:27:16,677 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,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 05:27:16,677 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:16,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:16,677 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,678 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:16,678 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:16,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,703 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:16,703 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:27:16,704 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 05:27:16,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:16,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:16,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:16,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:27:16,855 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:16,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 05:27:16,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:16,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 05:27:16,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2022-12-06 05:27:16,855 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 05:27:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash -914080273, now seen corresponding path program 1 times [2022-12-06 05:27:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:16,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219927044] [2022-12-06 05:27:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:16,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219927044] [2022-12-06 05:27:16,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219927044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:16,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:16,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871476396] [2022-12-06 05:27:16,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:16,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:16,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:16,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:16,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:16,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 05:27:16,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:16,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:16,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:17,198 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:17,198 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:27:17,204 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 05:27:17,211 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:17,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:17,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:17,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 05:27:17,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:17,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:17,244 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:17,244 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:17,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:17,244 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:17,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:17,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,269 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:17,269 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:17,270 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 05:27:17,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:17,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:17,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:27:17,420 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:17,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:17,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:17,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:17,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2022-12-06 05:27:17,420 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 05:27:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 828730062, now seen corresponding path program 1 times [2022-12-06 05:27:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:17,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165966616] [2022-12-06 05:27:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:17,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 05:27:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:17,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165966616] [2022-12-06 05:27:17,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165966616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:17,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:17,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:17,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009308212] [2022-12-06 05:27:17,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:17,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:17,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:17,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:17,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 05:27:17,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:17,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:17,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:17,786 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:17,786 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:17,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 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 05:27:17,797 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:17,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:17,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:17,798 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:17,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:17,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:17,827 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,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 05:27:17,827 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:17,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:17,827 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:17,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:17,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,852 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:17,852 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:27:17,853 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 05:27:17,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:17,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:17,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:17,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-06 05:27:17,984 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:17,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 05:27:17,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:17,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 05:27:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2022-12-06 05:27:17,984 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 05:27:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1723426899, now seen corresponding path program 1 times [2022-12-06 05:27:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66500001] [2022-12-06 05:27:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:18,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 05:27:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:18,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66500001] [2022-12-06 05:27:18,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66500001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:18,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:18,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059445445] [2022-12-06 05:27:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:18,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:18,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:18,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 05:27:18,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:18,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:18,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:18,315 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:18,315 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:27:18,322 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 05:27:18,329 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:18,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:18,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:18,330 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:18,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:18,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:18,363 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:18,363 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:18,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:18,364 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:18,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:18,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,388 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:18,388 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:18,389 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 05:27:18,391 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,391 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:18,551 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:18,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:27:18,552 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:18,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 05:27:18,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:18,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 05:27:18,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2022-12-06 05:27:18,552 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 05:27:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash 19383436, now seen corresponding path program 1 times [2022-12-06 05:27:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:18,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741620668] [2022-12-06 05:27:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:18,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 05:27:18,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:18,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741620668] [2022-12-06 05:27:18,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741620668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:18,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:18,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191651329] [2022-12-06 05:27:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:18,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:18,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:18,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 05:27:18,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:18,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:18,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:18,895 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:18,895 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:18,902 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 05:27:18,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:18,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:18,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:18,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 05:27:18,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:18,943 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,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 05:27:18,943 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:18,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:18,943 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:18,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:18,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,968 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:18,968 INFO L131 PetriNetUnfolder]: For 3141/3284 co-relation queries the response was YES. [2022-12-06 05:27:18,969 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 05:27:18,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:18,971 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:19,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:19,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:27:19,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:19,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 05:27:19,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:19,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 05:27:19,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2022-12-06 05:27:19,118 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 05:27:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1762193771, now seen corresponding path program 1 times [2022-12-06 05:27:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:19,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558603900] [2022-12-06 05:27:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:19,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:19,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558603900] [2022-12-06 05:27:19,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558603900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:19,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819283751] [2022-12-06 05:27:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:19,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:19,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:19,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 05:27:19,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:19,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:19,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:19,464 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:19,464 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:19,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:19,478 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:19,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:19,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:19,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 05:27:19,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:19,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:19,511 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:19,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 05:27:19,511 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:19,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:19,511 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:19,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:19,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:19,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:19,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:19,536 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:19,536 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:27:19,537 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 05:27:19,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:19,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:19,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:19,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:19,681 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:19,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 05:27:19,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:19,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 05:27:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2022-12-06 05:27:19,681 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 05:27:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -789963190, now seen corresponding path program 1 times [2022-12-06 05:27:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:19,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242212802] [2022-12-06 05:27:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:19,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 05:27:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:19,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242212802] [2022-12-06 05:27:19,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242212802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:19,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:19,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:19,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125352083] [2022-12-06 05:27:19,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:19,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:19,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:19,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:19,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:19,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 05:27:19,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:19,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:19,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:20,024 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:20,025 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:20,032 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 05:27:20,039 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:20,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:20,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:20,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 05:27:20,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:20,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:20,071 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:20,071 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:20,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:20,071 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:20,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:20,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,096 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:20,096 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:27:20,097 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 05:27:20,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:20,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:20,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:27:20,255 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:20,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:20,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:20,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:20,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2022-12-06 05:27:20,256 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 05:27:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 952847145, now seen corresponding path program 1 times [2022-12-06 05:27:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:20,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121817861] [2022-12-06 05:27:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121817861] [2022-12-06 05:27:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121817861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:20,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:20,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131528720] [2022-12-06 05:27:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:20,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:20,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:20,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:20,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:20,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:20,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:20,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:20,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:20,606 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:20,606 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:20,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:20,620 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:20,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:20,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:20,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 05:27:20,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:20,654 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:20,654 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:20,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:20,654 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:20,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:20,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,689 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:20,690 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:20,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 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 05:27:20,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:20,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:20,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:20,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:27:20,834 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:20,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:20,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:20,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 05:27:20,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2022-12-06 05:27:20,835 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 05:27:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1599309816, now seen corresponding path program 1 times [2022-12-06 05:27:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:20,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297712018] [2022-12-06 05:27:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:20,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 05:27:20,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:20,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297712018] [2022-12-06 05:27:20,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297712018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:20,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:20,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178601110] [2022-12-06 05:27:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:20,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:20,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:20,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:20,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:20,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 05:27:20,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:20,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:20,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:21,228 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:21,229 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:21,239 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 05:27:21,248 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:21,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:21,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:21,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 05:27:21,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:21,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 05:27:21,293 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,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 05:27:21,294 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:21,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:21,294 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:21,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:21,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,320 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:21,320 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:27:21,321 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 05:27:21,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:21,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:21,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:27:21,461 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:21,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 05:27:21,461 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:21,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 05:27:21,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2022-12-06 05:27:21,461 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 05:27:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 143500519, now seen corresponding path program 1 times [2022-12-06 05:27:21,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:21,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104526036] [2022-12-06 05:27:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:21,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104526036] [2022-12-06 05:27:21,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104526036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:21,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:21,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015332885] [2022-12-06 05:27:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:21,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:21,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:21,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:21,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:21,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:21,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:21,792 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:21,792 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:21,799 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 05:27:21,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:21,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:21,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:21,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 05:27:21,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:21,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 05:27:21,840 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,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 05:27:21,840 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:21,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:21,840 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:21,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:21,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,865 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:21,866 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:27:21,867 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 05:27:21,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:21,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:22,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:22,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:27:22,012 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:22,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 05:27:22,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:22,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:22,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2022-12-06 05:27:22,012 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 05:27:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1886310854, now seen corresponding path program 1 times [2022-12-06 05:27:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:22,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68606243] [2022-12-06 05:27:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:22,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 05:27:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:22,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68606243] [2022-12-06 05:27:22,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68606243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:22,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:22,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458150589] [2022-12-06 05:27:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:22,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:22,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:22,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:22,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 05:27:22,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:22,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:22,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:22,367 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:22,368 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:27:22,374 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 05:27:22,380 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:22,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:22,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:22,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 05:27:22,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:22,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 05:27:22,408 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:22,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 05:27:22,408 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:22,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:22,408 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:22,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:22,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:22,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:22,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:22,433 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:22,433 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:27:22,434 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 05:27:22,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:22,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:22,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:22,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:27:22,591 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:22,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:22,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:22,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:22,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2022-12-06 05:27:22,592 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 05:27:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -665846107, now seen corresponding path program 1 times [2022-12-06 05:27:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:22,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34711172] [2022-12-06 05:27:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:22,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34711172] [2022-12-06 05:27:22,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34711172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:22,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:22,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779748993] [2022-12-06 05:27:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:22,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:22,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:22,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:22,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:22,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 05:27:22,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:22,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:22,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:22,967 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:22,968 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:22,982 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:22,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:22,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:22,983 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:22,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:23,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 05:27:23,017 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,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 05:27:23,017 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:23,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:23,017 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:23,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:23,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,042 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:23,042 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:23,043 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 05:27:23,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:23,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:23,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:27:23,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:23,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:23,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175 [2022-12-06 05:27:23,199 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 05:27:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1076964228, now seen corresponding path program 1 times [2022-12-06 05:27:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:23,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931793021] [2022-12-06 05:27:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:23,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 05:27:23,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:23,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931793021] [2022-12-06 05:27:23,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931793021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:23,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:23,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:23,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117484836] [2022-12-06 05:27:23,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:23,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:23,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:23,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:23,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 05:27:23,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:23,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:23,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:23,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:23,524 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:23,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:23,537 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:23,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:23,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:23,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 05:27:23,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:23,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 05:27:23,570 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,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 05:27:23,570 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:23,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:23,570 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:23,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:23,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,595 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:23,595 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:27:23,596 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 05:27:23,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:23,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:23,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:23,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:27:23,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:23,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 05:27:23,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:23,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 05:27:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1176 [2022-12-06 05:27:23,743 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 05:27:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1475192733, now seen corresponding path program 1 times [2022-12-06 05:27:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:23,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578660581] [2022-12-06 05:27:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578660581] [2022-12-06 05:27:23,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578660581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:23,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:23,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584535815] [2022-12-06 05:27:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:23,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:23,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:23,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:23,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:23,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:23,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:23,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:24,084 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:24,084 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:27:24,091 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 05:27:24,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:24,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:24,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:24,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 05:27:24,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:24,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:24,133 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,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 05:27:24,133 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:24,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:24,133 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:24,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:24,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,158 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:24,158 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:24,159 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 05:27:24,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:24,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:24,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:24,315 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:24,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 05:27:24,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:24,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 05:27:24,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1177 [2022-12-06 05:27:24,315 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 05:27:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash 267617602, now seen corresponding path program 1 times [2022-12-06 05:27:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:24,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89764777] [2022-12-06 05:27:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:24,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89764777] [2022-12-06 05:27:24,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89764777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:24,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:24,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716122863] [2022-12-06 05:27:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:24,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:24,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:24,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:24,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:24,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:24,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:24,638 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:24,638 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:24,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:24,651 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:24,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:24,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:24,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 05:27:24,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:24,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:24,685 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:24,685 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:24,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:24,685 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:24,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:24,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,710 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:24,710 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:27:24,711 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 05:27:24,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:24,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:24,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:24,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:27:24,853 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:24,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:24,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:24,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:24,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1178 [2022-12-06 05:27:24,853 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 05:27:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2010427937, now seen corresponding path program 1 times [2022-12-06 05:27:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:24,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403338892] [2022-12-06 05:27:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:24,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 05:27:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:24,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403338892] [2022-12-06 05:27:24,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403338892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:24,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:24,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483048854] [2022-12-06 05:27:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:24,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:24,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:24,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:24,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 05:27:24,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:24,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:24,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:25,206 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:25,207 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:25,213 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 05:27:25,221 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:25,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:25,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:25,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 05:27:25,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:25,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:25,280 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:25,280 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:25,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:25,280 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:25,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:25,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,305 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:25,306 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 05:27:25,307 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 05:27:25,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:25,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:25,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:27:25,460 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:25,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 05:27:25,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:25,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 05:27:25,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1179 [2022-12-06 05:27:25,460 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 05:27:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -541729024, now seen corresponding path program 1 times [2022-12-06 05:27:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:25,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183229172] [2022-12-06 05:27:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:25,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:25,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183229172] [2022-12-06 05:27:25,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183229172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:25,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:25,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541724339] [2022-12-06 05:27:25,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:25,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:25,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:25,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:25,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:25,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:25,788 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:25,788 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:25,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:25,803 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:25,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:25,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:25,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 05:27:25,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:25,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 05:27:25,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,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 05:27:25,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:25,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:25,838 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:25,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:25,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,863 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:25,863 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:27:25,864 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 05:27:25,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:25,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:26,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:26,022 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:27:26,022 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:26,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:26,022 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:26,022 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:26,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1180 [2022-12-06 05:27:26,023 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 05:27:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1201081311, now seen corresponding path program 1 times [2022-12-06 05:27:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:26,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001758254] [2022-12-06 05:27:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:26,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 05:27:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:26,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001758254] [2022-12-06 05:27:26,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001758254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:26,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:26,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806143220] [2022-12-06 05:27:26,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:26,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:26,084 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:26,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 05:27:26,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:26,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:26,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:26,349 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:26,349 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:26,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 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 05:27:26,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:26,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:26,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:26,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 05:27:26,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:26,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:26,397 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,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 05:27:26,398 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:26,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:26,398 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:26,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:26,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,422 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:26,422 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:26,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 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 05:27:26,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:26,567 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:26,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:26,568 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:26,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:26,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:26,568 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:26,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1181 [2022-12-06 05:27:26,568 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 05:27:26,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1351075650, now seen corresponding path program 1 times [2022-12-06 05:27:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469083293] [2022-12-06 05:27:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469083293] [2022-12-06 05:27:26,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469083293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:26,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:26,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516489295] [2022-12-06 05:27:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:26,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:26,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:26,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:26,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:26,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:26,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:26,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:26,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:26,924 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:26,924 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:26,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 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 05:27:26,937 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:26,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:26,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:26,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 05:27:26,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:26,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 05:27:26,968 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,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 05:27:26,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:26,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:26,969 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:26,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:26,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,993 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:26,993 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:27:26,994 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 05:27:26,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:26,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:27,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:27,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:27:27,149 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:27,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:27,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:27,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:27,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1182 [2022-12-06 05:27:27,149 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 05:27:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 391734685, now seen corresponding path program 1 times [2022-12-06 05:27:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:27,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434804130] [2022-12-06 05:27:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:27,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 05:27:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:27,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434804130] [2022-12-06 05:27:27,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434804130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:27,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:27,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:27,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811862391] [2022-12-06 05:27:27,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:27,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:27,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 05:27:27,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:27,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:27,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:27,478 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:27,478 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:27,485 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 05:27:27,492 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:27,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:27,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:27,493 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:27,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:27,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 05:27:27,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:27,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 05:27:27,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:27,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:27,526 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:27,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:27,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:27,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:27,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:27,551 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:27,551 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:27:27,552 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 05:27:27,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:27,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:27,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:27,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:27:27,694 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:27,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:27,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:27,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1183 [2022-12-06 05:27:27,694 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 05:27:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2134545020, now seen corresponding path program 1 times [2022-12-06 05:27:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:27,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248322784] [2022-12-06 05:27:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:27,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 05:27:27,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:27,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248322784] [2022-12-06 05:27:27,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248322784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:27,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:27,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414621513] [2022-12-06 05:27:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:27,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:27,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:27,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 05:27:27,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:27,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:27,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:28,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:28,048 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:27:28,055 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 05:27:28,062 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:28,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:28,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:28,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 05:27:28,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:28,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 05:27:28,096 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,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 05:27:28,096 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:28,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:28,097 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,097 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:28,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:28,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,122 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:28,122 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:27:28,124 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 05:27:28,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:28,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:28,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:27:28,288 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:28,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 05:27:28,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:28,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 05:27:28,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1184 [2022-12-06 05:27:28,288 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 05:27:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash -417611941, now seen corresponding path program 1 times [2022-12-06 05:27:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:28,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368619783] [2022-12-06 05:27:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:28,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:28,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 05:27:28,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:28,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368619783] [2022-12-06 05:27:28,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368619783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:28,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:28,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699958096] [2022-12-06 05:27:28,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:28,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:28,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:28,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 05:27:28,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:28,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:28,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:28,616 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:28,616 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:28,623 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 05:27:28,630 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:28,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:28,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:28,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 05:27:28,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:28,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 05:27:28,662 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,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 05:27:28,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:28,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:28,662 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:28,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:28,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,687 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:28,687 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:27:28,688 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 05:27:28,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:28,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:28,831 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:28,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:27:28,831 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:28,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 05:27:28,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:28,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 05:27:28,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1185 [2022-12-06 05:27:28,831 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 05:27:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1325198394, now seen corresponding path program 1 times [2022-12-06 05:27:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:28,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125628911] [2022-12-06 05:27:28,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:28,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125628911] [2022-12-06 05:27:28,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125628911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:28,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:28,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785328191] [2022-12-06 05:27:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:28,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:28,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:28,889 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:28,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:28,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:28,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:28,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:29,152 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:29,152 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:29,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 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 05:27:29,167 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:29,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:29,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:29,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 05:27:29,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:29,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 05:27:29,200 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,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 05:27:29,200 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:29,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:29,200 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:29,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:29,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,225 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:29,225 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:27:29,226 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 05:27:29,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:29,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:29,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:27:29,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:29,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 05:27:29,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:29,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 05:27:29,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1186 [2022-12-06 05:27:29,367 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 05:27:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1226958567, now seen corresponding path program 1 times [2022-12-06 05:27:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:29,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209652898] [2022-12-06 05:27:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:29,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 05:27:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:29,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209652898] [2022-12-06 05:27:29,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209652898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:29,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:29,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:29,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22963984] [2022-12-06 05:27:29,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:29,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:29,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:29,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 05:27:29,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:29,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:29,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:29,745 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:29,745 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:27:29,751 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 05:27:29,757 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:29,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:29,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:29,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 05:27:29,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:29,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 05:27:29,791 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,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 05:27:29,791 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:29,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:29,791 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:29,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:29,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,816 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:29,816 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:29,817 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 05:27:29,819 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:29,819 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:29,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:29,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:27:29,975 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:29,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 05:27:29,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:29,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 05:27:29,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1187 [2022-12-06 05:27:29,975 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 05:27:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash 515851768, now seen corresponding path program 1 times [2022-12-06 05:27:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943856920] [2022-12-06 05:27:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:30,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:30,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943856920] [2022-12-06 05:27:30,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943856920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:30,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:30,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503132058] [2022-12-06 05:27:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:30,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:30,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:30,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 05:27:30,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:30,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:30,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:30,319 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:30,319 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:30,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:30,332 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:30,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:30,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:30,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 05:27:30,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:30,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 05:27:30,368 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,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 05:27:30,368 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:30,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:30,368 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:30,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:30,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,393 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:30,393 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:27:30,394 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 05:27:30,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:30,545 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:30,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:27:30,546 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:30,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 05:27:30,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:30,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 05:27:30,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1188 [2022-12-06 05:27:30,546 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 05:27:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2036305193, now seen corresponding path program 1 times [2022-12-06 05:27:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:30,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994574411] [2022-12-06 05:27:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:30,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:30,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994574411] [2022-12-06 05:27:30,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994574411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:30,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:30,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029077333] [2022-12-06 05:27:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:30,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:30,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:30,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:30,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:30,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:30,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:30,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:30,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:30,880 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:30,880 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:30,887 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 05:27:30,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:30,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:30,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:30,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 05:27:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:30,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:30,926 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27: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 05:27:30,927 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:30,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:30,927 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:30,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:30,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,952 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:30,952 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:27:30,953 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 05:27:30,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:30,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:31,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:31,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:27:31,106 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:31,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 05:27:31,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:31,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1189 [2022-12-06 05:27:31,107 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 05:27:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash -293494858, now seen corresponding path program 1 times [2022-12-06 05:27:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:31,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761089120] [2022-12-06 05:27:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:31,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 05:27:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761089120] [2022-12-06 05:27:31,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761089120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:31,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:31,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490685563] [2022-12-06 05:27:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:31,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:31,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:31,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:31,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 05:27:31,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:31,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:31,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:31,461 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:31,461 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:31,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:31,476 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:31,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:31,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:31,477 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:31,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:31,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 05:27:31,508 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:31,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:31,509 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:31,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:31,509 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:31,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:31,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:31,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:31,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:31,533 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:31,534 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:31,534 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 05:27:31,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:31,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:31,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:31,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:31,679 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:31,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 05:27:31,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:31,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 05:27:31,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190 [2022-12-06 05:27:31,679 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 05:27:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1449315477, now seen corresponding path program 1 times [2022-12-06 05:27:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100001639] [2022-12-06 05:27:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:31,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 05:27:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:31,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100001639] [2022-12-06 05:27:31,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100001639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:31,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:31,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915893677] [2022-12-06 05:27:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:31,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:31,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:31,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 05:27:31,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:31,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:31,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:32,029 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:32,029 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:32,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 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 05:27:32,043 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:32,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:32,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:32,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 05:27:32,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:32,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:32,078 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:32,078 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:32,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:32,078 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:32,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:32,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,103 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:32,103 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:27:32,104 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 05:27:32,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:32,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:32,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:27:32,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:32,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 05:27:32,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:32,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 05:27:32,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1191 [2022-12-06 05:27:32,266 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 05:27:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1102841484, now seen corresponding path program 1 times [2022-12-06 05:27:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:32,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255844126] [2022-12-06 05:27:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:32,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255844126] [2022-12-06 05:27:32,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255844126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:32,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:32,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810050931] [2022-12-06 05:27:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:32,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:32,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:32,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:32,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:32,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:32,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:32,604 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:32,605 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:32,612 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 05:27:32,620 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:32,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:32,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:32,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 05:27:32,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:32,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 05:27:32,682 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,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 05:27:32,682 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:32,682 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:32,682 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:32,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:32,683 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,707 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:32,708 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:27:32,709 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 05:27:32,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:32,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:32,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:32,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:27:32,856 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:32,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 05:27:32,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:32,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 05:27:32,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1192 [2022-12-06 05:27:32,856 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 05:27:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash 639968851, now seen corresponding path program 1 times [2022-12-06 05:27:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:32,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106392903] [2022-12-06 05:27:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:32,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:32,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 05:27:32,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:32,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106392903] [2022-12-06 05:27:32,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106392903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:32,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:32,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689563971] [2022-12-06 05:27:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:32,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:32,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:32,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:32,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:32,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 05:27:32,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:32,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:32,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:33,189 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:33,189 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:33,196 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 05:27:33,203 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:33,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:33,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:33,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:33,204 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:33,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:33,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 05:27:33,238 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,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 05:27:33,238 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:33,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:33,239 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:33,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:33,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,263 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:33,263 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:33,265 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 05:27:33,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,266 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:33,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:33,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:27:33,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:33,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 05:27:33,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:33,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 05:27:33,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1193 [2022-12-06 05:27:33,415 INFO L420 AbstractCegarLoop]: === Iteration 1195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:27:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1912188110, now seen corresponding path program 1 times [2022-12-06 05:27:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:33,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856554974] [2022-12-06 05:27:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:33,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856554974] [2022-12-06 05:27:33,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856554974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:33,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:33,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690384698] [2022-12-06 05:27:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:33,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:33,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:33,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:33,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:33,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:33,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:33,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:33,761 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:33,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 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 05:27:33,775 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:33,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:33,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:33,776 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:33,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:33,808 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:33,808 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:33,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:33,808 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:33,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:33,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,833 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:33,833 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:33,834 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 05:27:33,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:33,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:33,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:33,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:27:33,994 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:33,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:33,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:33,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:33,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1194 [2022-12-06 05:27:33,994 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 05:27:33,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash -169377775, now seen corresponding path program 1 times [2022-12-06 05:27:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:33,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669596425] [2022-12-06 05:27:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:34,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669596425] [2022-12-06 05:27:34,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669596425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:34,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:34,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85866520] [2022-12-06 05:27:34,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:34,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:34,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 05:27:34,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:34,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:34,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:34,331 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:34,332 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:34,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 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 05:27:34,345 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:34,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:34,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:34,346 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:34,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:34,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 05:27:34,379 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,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 05:27:34,379 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:34,379 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:34,379 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:34,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:34,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,404 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:34,404 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:34,405 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 05:27:34,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:34,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:34,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:27:34,558 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:34,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 05:27:34,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:34,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 05:27:34,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195 [2022-12-06 05:27:34,559 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 05:27:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1573432560, now seen corresponding path program 1 times [2022-12-06 05:27:34,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:34,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067750802] [2022-12-06 05:27:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:34,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 05:27:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:34,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067750802] [2022-12-06 05:27:34,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067750802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:34,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:34,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094835769] [2022-12-06 05:27:34,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:34,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:34,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:34,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:34,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:34,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:34,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 05:27:34,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:34,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:34,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:34,885 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:34,885 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:34,891 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 05:27:34,898 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:34,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:34,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:34,899 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:34,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:34,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:34,934 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:34,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:34,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:34,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:34,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:34,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,959 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:34,959 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 05:27:34,960 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 05:27:34,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:34,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:35,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:35,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:27:35,108 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:35,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:35,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:35,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1196 [2022-12-06 05:27:35,108 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 05:27:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -978724401, now seen corresponding path program 1 times [2022-12-06 05:27:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417028337] [2022-12-06 05:27:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:35,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 05:27:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:35,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417028337] [2022-12-06 05:27:35,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417028337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:35,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:35,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393282014] [2022-12-06 05:27:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:35,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:35,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:35,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:35,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:35,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 05:27:35,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:35,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:35,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:35,504 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:35,504 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:35,511 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 05:27:35,519 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:35,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:35,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:35,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 05:27:35,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:35,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 05:27:35,553 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:35,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 05:27:35,553 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:35,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:35,553 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:35,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:35,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:35,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:35,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:35,578 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:35,578 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:27:35,579 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 05:27:35,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:35,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:35,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:35,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:27:35,742 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:35,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 05:27:35,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:35,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 05:27:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1197 [2022-12-06 05:27:35,742 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 05:27:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash 764085934, now seen corresponding path program 1 times [2022-12-06 05:27:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:35,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427562045] [2022-12-06 05:27:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27: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 05:27:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427562045] [2022-12-06 05:27:35,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427562045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:35,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332764232] [2022-12-06 05:27:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:35,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:35,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:35,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27: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 05:27:35,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:35,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:35,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:36,085 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:36,085 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:36,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 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 05:27:36,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:36,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:36,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:36,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 05:27:36,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:36,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:36,133 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,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 05:27:36,133 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:36,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:36,133 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:36,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:36,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,158 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:36,158 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:27:36,159 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 05:27:36,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:36,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:36,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:27:36,317 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:36,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 05:27:36,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:36,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 05:27:36,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1198 [2022-12-06 05:27:36,317 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 05:27:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:36,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1788071027, now seen corresponding path program 1 times [2022-12-06 05:27:36,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:36,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311388124] [2022-12-06 05:27:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:36,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 05:27:36,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:36,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311388124] [2022-12-06 05:27:36,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311388124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:36,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:36,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710003957] [2022-12-06 05:27:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:36,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:36,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:36,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 05:27:36,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:36,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:36,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:36,664 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:36,665 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:27:36,672 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 05:27:36,679 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:36,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:36,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:36,680 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:36,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:36,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:36,713 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,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 05:27:36,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:36,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:36,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:36,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:36,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,738 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:36,738 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:36,740 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 05:27:36,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:36,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:36,928 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:36,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 05:27:36,928 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:36,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 05:27:36,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:36,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 05:27:36,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1199 [2022-12-06 05:27:36,929 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 05:27:36,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -45260692, now seen corresponding path program 1 times [2022-12-06 05:27:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:36,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670409514] [2022-12-06 05:27:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:37,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 05:27:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:37,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670409514] [2022-12-06 05:27:37,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670409514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:37,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:37,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839838593] [2022-12-06 05:27:37,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:37,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:37,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:37,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 05:27:37,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:37,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:37,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:37,387 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:37,387 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:37,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:37,399 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:37,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:37,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:37,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 05:27:37,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:37,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 05:27:37,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:37,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 05:27:37,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:37,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:37,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:37,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:37,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:37,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:37,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:37,455 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:37,455 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:27:37,457 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 05:27:37,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:37,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:37,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:37,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:27:37,605 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:37,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:37,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:37,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:37,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1200 [2022-12-06 05:27:37,606 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 05:27:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1697549643, now seen corresponding path program 1 times [2022-12-06 05:27:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:37,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125218989] [2022-12-06 05:27:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:37,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:37,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125218989] [2022-12-06 05:27:37,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125218989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:37,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:37,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:37,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548943881] [2022-12-06 05:27:37,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:37,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:37,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:37,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:37,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:37,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:37,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:37,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:37,951 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:37,951 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:37,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:37,966 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:37,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:37,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:37,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 05:27:37,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:37,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:37,999 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:37,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:38,000 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:38,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:38,000 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:38,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:38,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,025 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:38,025 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:38,026 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 05:27:38,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:38,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:38,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:27:38,172 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:38,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 05:27:38,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:38,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 05:27:38,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1201 [2022-12-06 05:27:38,172 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 05:27:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -854607318, now seen corresponding path program 1 times [2022-12-06 05:27:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83586550] [2022-12-06 05:27:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:38,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83586550] [2022-12-06 05:27:38,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83586550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:38,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:38,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048831097] [2022-12-06 05:27:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:38,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:38,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:38,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 05:27:38,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:38,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:38,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:38,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:38,525 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:38,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 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 05:27:38,539 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:38,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:38,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:38,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 05:27:38,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:38,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 05:27:38,574 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,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 05:27:38,574 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:38,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:38,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:38,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:38,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,599 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:38,599 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:38,600 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 05:27:38,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:38,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:38,746 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:38,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:27:38,747 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:38,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:38,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:38,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:38,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1202 [2022-12-06 05:27:38,747 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 05:27:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 888203017, now seen corresponding path program 1 times [2022-12-06 05:27:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:38,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931944609] [2022-12-06 05:27:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:38,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 05:27:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:38,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931944609] [2022-12-06 05:27:38,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931944609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:38,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:38,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673058616] [2022-12-06 05:27:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:38,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:38,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:38,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 05:27:38,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:38,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:38,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:39,088 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:39,088 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:39,095 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 05:27:39,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:39,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:39,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:39,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 05:27:39,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:39,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 05:27:39,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,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 05:27:39,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:39,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:39,137 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:39,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:39,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,162 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:39,162 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:39,163 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 05:27:39,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:39,322 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:39,322 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:27:39,322 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:39,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:39,322 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:39,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 05:27:39,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203 [2022-12-06 05:27:39,322 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 05:27:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1663953944, now seen corresponding path program 1 times [2022-12-06 05:27:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:39,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146605001] [2022-12-06 05:27:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:39,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 05:27:39,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:39,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146605001] [2022-12-06 05:27:39,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146605001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:39,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:39,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932598207] [2022-12-06 05:27:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:39,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:39,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:39,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:39,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 05:27:39,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:39,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:39,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:39,658 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:39,658 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:39,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 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 05:27:39,671 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:39,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:39,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:39,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 05:27:39,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:39,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:39,705 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:39,705 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:39,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:39,705 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:39,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:39,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,730 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:39,730 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:27:39,731 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 05:27:39,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:39,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:39,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:39,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:27:39,869 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:39,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 05:27:39,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:39,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 05:27:39,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204 [2022-12-06 05:27:39,870 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 05:27:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash 78856391, now seen corresponding path program 1 times [2022-12-06 05:27:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:39,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79583974] [2022-12-06 05:27:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:39,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:39,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79583974] [2022-12-06 05:27:39,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79583974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:39,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:39,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787031544] [2022-12-06 05:27:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:39,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:39,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:39,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:39,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 05:27:39,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:39,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:39,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:40,226 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:40,226 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:40,232 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 05:27:40,238 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:40,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:40,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:40,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 05:27:40,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:40,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:40,266 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:40,267 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:40,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:40,267 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:40,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:40,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,292 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:40,292 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 05:27:40,293 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 05:27:40,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:40,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:40,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:27:40,448 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:40,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 05:27:40,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:40,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 05:27:40,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1205 [2022-12-06 05:27:40,448 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 05:27:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1821666726, now seen corresponding path program 1 times [2022-12-06 05:27:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515903410] [2022-12-06 05:27:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:40,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 05:27:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:40,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515903410] [2022-12-06 05:27:40,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515903410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:40,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:40,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:40,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489156185] [2022-12-06 05:27:40,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:40,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:40,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:40,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 05:27:40,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:40,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:40,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:40,799 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:40,800 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:40,807 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 05:27:40,814 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:40,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:40,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:40,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 05:27:40,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:40,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 05:27:40,849 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,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 05:27:40,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:40,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:40,850 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:40,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:40,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,875 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:40,875 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:27:40,876 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 05:27:40,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:40,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:41,026 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:41,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:27:41,026 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:41,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 05:27:41,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:41,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 05:27:41,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1206 [2022-12-06 05:27:41,027 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 05:27:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash -730490235, now seen corresponding path program 1 times [2022-12-06 05:27:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:41,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878902384] [2022-12-06 05:27:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:41,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878902384] [2022-12-06 05:27:41,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878902384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:41,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:41,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56018686] [2022-12-06 05:27:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:41,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:41,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:41,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:41,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:41,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:41,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:41,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:41,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:41,370 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:41,370 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:41,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 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 05:27:41,384 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:41,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:41,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:41,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 05:27:41,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:41,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 05:27:41,417 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:41,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:41,417 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:41,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:41,417 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:41,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:41,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:41,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:41,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:41,442 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:41,442 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:41,443 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 05:27:41,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:41,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:41,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:41,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:27:41,608 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:41,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:41,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:41,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:41,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1207 [2022-12-06 05:27:41,609 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 05:27:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1012320100, now seen corresponding path program 1 times [2022-12-06 05:27:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:41,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202261757] [2022-12-06 05:27:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:41,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202261757] [2022-12-06 05:27:41,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202261757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:41,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:41,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:41,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835859511] [2022-12-06 05:27:41,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:41,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:41,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:41,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:41,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:41,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:41,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:41,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:41,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:41,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:41,961 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:41,968 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 05:27:41,975 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:41,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:41,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:41,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 05:27:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:42,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 05:27:42,009 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,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 05:27:42,009 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:42,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:42,009 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:42,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:42,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,034 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:42,034 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 05:27:42,035 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 05:27:42,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:42,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:42,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:42,191 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:42,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:42,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:42,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208 [2022-12-06 05:27:42,191 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 05:27:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1539836861, now seen corresponding path program 1 times [2022-12-06 05:27:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:42,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112955321] [2022-12-06 05:27:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:42,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112955321] [2022-12-06 05:27:42,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112955321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:42,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:42,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3339188] [2022-12-06 05:27:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:42,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:42,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:42,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:42,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:42,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:42,522 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:42,522 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:42,529 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 05:27:42,536 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:42,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:42,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:42,537 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:42,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:42,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 05:27:42,570 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,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 05:27:42,571 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:42,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:42,571 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,571 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:42,571 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:42,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,597 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:42,597 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:27:42,598 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 05:27:42,600 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:42,600 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:42,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:42,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:42,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:42,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 05:27:42,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:42,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 05:27:42,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1209 [2022-12-06 05:27:42,753 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 05:27:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash 202973474, now seen corresponding path program 1 times [2022-12-06 05:27:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:42,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235113737] [2022-12-06 05:27:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:42,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 05:27:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:42,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235113737] [2022-12-06 05:27:42,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235113737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:42,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:42,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059609237] [2022-12-06 05:27:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:42,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27: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 05:27:42,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:42,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:42,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:43,139 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:43,139 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:43,146 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 05:27:43,154 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:43,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:43,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:43,155 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:43,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:43,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 05:27:43,189 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,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 05:27:43,189 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:43,189 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:43,189 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:43,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:43,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,225 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:43,225 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:27:43,226 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 05:27:43,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:43,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:43,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:27:43,363 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:43,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 05:27:43,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:43,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 05:27:43,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1210 [2022-12-06 05:27:43,364 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 05:27:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1945783809, now seen corresponding path program 1 times [2022-12-06 05:27:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:43,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473684292] [2022-12-06 05:27:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:43,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 05:27:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:43,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473684292] [2022-12-06 05:27:43,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473684292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:43,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:43,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960407976] [2022-12-06 05:27:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:43,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:43,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 05:27:43,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:43,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:43,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:43,709 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:43,709 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:43,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:43,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:43,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:43,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:43,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 05:27:43,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:43,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 05:27:43,756 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,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 05:27:43,757 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:43,757 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:43,757 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,757 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:43,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:43,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,781 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:43,782 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:43,783 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 05:27:43,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:43,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:43,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:43,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:27:43,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:43,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 05:27:43,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:43,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 05:27:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1211 [2022-12-06 05:27:43,935 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 05:27:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash -606373152, now seen corresponding path program 1 times [2022-12-06 05:27:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033642094] [2022-12-06 05:27:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:43,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 05:27:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:43,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033642094] [2022-12-06 05:27:43,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033642094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:43,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:43,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884528163] [2022-12-06 05:27:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:43,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:43,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:43,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 05:27:43,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:43,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:43,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:44,269 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:44,270 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:44,276 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 05:27:44,284 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:44,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:44,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:44,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 05:27:44,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:44,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 05:27:44,320 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,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 05:27:44,320 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:44,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:44,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:44,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:44,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,345 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:44,345 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:27:44,346 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 05:27:44,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:44,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:44,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:27:44,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:44,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 05:27:44,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:44,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 05:27:44,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1212 [2022-12-06 05:27:44,497 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 05:27:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1136437183, now seen corresponding path program 1 times [2022-12-06 05:27:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:44,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569756256] [2022-12-06 05:27:44,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:44,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569756256] [2022-12-06 05:27:44,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569756256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:44,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:44,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887132050] [2022-12-06 05:27:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:44,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:44,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:44,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:44,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 05:27:44,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:44,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:44,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:44,872 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:44,872 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:44,879 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 05:27:44,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:44,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:44,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:44,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 05:27:44,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:44,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 05:27:44,916 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,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 05:27:44,916 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:44,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:44,916 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,916 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:44,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:44,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,941 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:44,941 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:44,942 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 05:27:44,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:44,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:45,088 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:45,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:27:45,089 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:45,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 05:27:45,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:45,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 05:27:45,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213 [2022-12-06 05:27:45,089 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 05:27:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1415719778, now seen corresponding path program 1 times [2022-12-06 05:27:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798106772] [2022-12-06 05:27:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:45,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 05:27:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:45,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798106772] [2022-12-06 05:27:45,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798106772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:45,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:45,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747829494] [2022-12-06 05:27:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:45,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:45,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:45,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 05:27:45,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:45,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:45,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:45,439 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:45,440 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:45,447 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 05:27:45,454 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:45,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:45,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:45,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27: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 05:27:45,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:45,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 05:27:45,489 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:45,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 05:27:45,489 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:45,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:45,489 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:45,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:45,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:45,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:45,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:45,515 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:45,515 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:45,516 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 05:27:45,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:45,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:45,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:45,671 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:27:45,671 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:45,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 05:27:45,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:45,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 05:27:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1214 [2022-12-06 05:27:45,671 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 05:27:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash 327090557, now seen corresponding path program 1 times [2022-12-06 05:27:45,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:45,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316521292] [2022-12-06 05:27:45,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:45,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:45,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316521292] [2022-12-06 05:27:45,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316521292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:45,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:45,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040852324] [2022-12-06 05:27:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:45,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:45,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:45,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:45,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:45,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:45,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:45,997 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:45,998 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:46,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 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 05:27:46,012 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:46,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:46,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:46,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 05:27:46,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:46,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 05:27:46,045 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,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 05:27:46,045 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:46,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:46,046 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:46,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:46,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,076 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:46,077 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:27:46,078 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 05:27:46,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:46,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:46,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:27:46,233 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:46,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:46,233 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:46,233 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:46,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1215 [2022-12-06 05:27:46,233 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 05:27:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2069900892, now seen corresponding path program 1 times [2022-12-06 05:27:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:46,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024376831] [2022-12-06 05:27:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:46,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 05:27:46,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:46,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024376831] [2022-12-06 05:27:46,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024376831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:46,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:46,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735322473] [2022-12-06 05:27:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:46,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:46,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:46,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:46,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:46,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 05:27:46,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:46,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:46,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:46,569 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:46,569 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:46,575 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 05:27:46,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:46,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:46,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27: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 05:27:46,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:46,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 05:27:46,614 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:46,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:46,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:46,614 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:46,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:46,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,639 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:46,639 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 05:27:46,640 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 05:27:46,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:46,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:46,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:46,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:27:46,789 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:46,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:46,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:46,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:46,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1216 [2022-12-06 05:27:46,789 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 05:27:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash -482256069, now seen corresponding path program 1 times [2022-12-06 05:27:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:46,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698387880] [2022-12-06 05:27:46,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:46,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 05:27:46,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:46,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698387880] [2022-12-06 05:27:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698387880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:46,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460352962] [2022-12-06 05:27:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:46,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:46,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 05:27:46,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:46,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:47,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:47,134 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:47,142 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 05:27:47,149 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:47,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:47,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:47,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 05:27:47,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:47,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:47,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:47,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:47,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:47,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:47,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:47,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,206 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:47,206 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:47,207 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 05:27:47,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:47,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:47,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:27:47,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:47,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 05:27:47,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:47,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 05:27:47,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217 [2022-12-06 05:27:47,366 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 05:27:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1260554266, now seen corresponding path program 1 times [2022-12-06 05:27:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:47,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763678526] [2022-12-06 05:27:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:47,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 05:27:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:47,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763678526] [2022-12-06 05:27:47,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763678526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:47,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:47,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460540202] [2022-12-06 05:27:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:47,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:47,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:47,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:47,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 05:27:47,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:47,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:47,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:47,733 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:47,733 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:47,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 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 05:27:47,744 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:47,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:47,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:47,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 05:27:47,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:47,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:47,775 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:47,775 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:47,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:47,775 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:47,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:47,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,800 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:47,800 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:27:47,801 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 05:27:47,803 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:47,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:47,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:47,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:47,945 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:47,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 05:27:47,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:47,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 05:27:47,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1218 [2022-12-06 05:27:47,945 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 05:27:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1291602695, now seen corresponding path program 1 times [2022-12-06 05:27:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:47,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598554945] [2022-12-06 05:27:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:48,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:48,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598554945] [2022-12-06 05:27:48,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598554945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:48,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:48,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138513592] [2022-12-06 05:27:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:48,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:48,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:48,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:48,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:48,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:48,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 05:27:48,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:48,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:48,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:48,293 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:48,300 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 05:27:48,307 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:48,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:48,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:48,308 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:48,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:48,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 05:27:48,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,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 05:27:48,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:48,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:48,339 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:48,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:48,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,363 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:48,363 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:27:48,364 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 05:27:48,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:48,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:48,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:27:48,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:48,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 05:27:48,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:48,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 05:27:48,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1219 [2022-12-06 05:27:48,510 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 05:27:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash 451207640, now seen corresponding path program 1 times [2022-12-06 05:27:48,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:48,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039984745] [2022-12-06 05:27:48,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:48,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039984745] [2022-12-06 05:27:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039984745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977925966] [2022-12-06 05:27:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:48,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:48,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:48,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:48,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:48,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:48,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:48,843 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:48,843 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:48,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 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 05:27:48,858 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:48,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:48,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:48,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 05:27:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:48,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 05:27:48,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,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 05:27:48,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:48,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:48,894 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:48,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:48,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,919 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:48,919 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:27:48,920 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 05:27:48,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:48,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:49,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:49,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:27:49,065 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:49,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 05:27:49,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:49,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 05:27:49,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1220 [2022-12-06 05:27:49,065 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 05:27:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2100949321, now seen corresponding path program 1 times [2022-12-06 05:27:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908904411] [2022-12-06 05:27:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:49,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908904411] [2022-12-06 05:27:49,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908904411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:49,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:49,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307068949] [2022-12-06 05:27:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:49,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:49,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:49,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:49,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:49,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:49,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:49,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:49,406 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:49,406 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:49,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 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 05:27:49,420 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:49,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:49,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:49,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 05:27:49,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:49,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 05:27:49,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:49,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 05:27:49,455 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:49,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:49,455 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:49,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:49,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:49,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:49,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:49,479 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:49,480 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:49,480 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 05:27:49,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:49,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:49,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:49,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:27:49,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:49,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 05:27:49,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:49,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 05:27:49,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1221 [2022-12-06 05:27:49,634 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 05:27:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash -358138986, now seen corresponding path program 1 times [2022-12-06 05:27:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:49,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297437900] [2022-12-06 05:27:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:49,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 05:27:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:49,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297437900] [2022-12-06 05:27:49,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297437900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:49,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:49,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227738899] [2022-12-06 05:27:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:49,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:49,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 05:27:49,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:49,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:49,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:49,981 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:49,981 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:49,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 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 05:27:49,995 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:49,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:49,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:49,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 05:27:49,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:50,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:50,028 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:50,028 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:50,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:50,029 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:50,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:50,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,054 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:50,054 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:50,055 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 05:27:50,057 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:50,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:50,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:27:50,196 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27: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 05:27:50,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27: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 05:27:50,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1222 [2022-12-06 05:27:50,196 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 05:27:50,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1384671349, now seen corresponding path program 1 times [2022-12-06 05:27:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:50,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157253264] [2022-12-06 05:27:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157253264] [2022-12-06 05:27:50,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157253264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:50,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106390235] [2022-12-06 05:27:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:50,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:50,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 05:27:50,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:50,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:50,529 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:50,530 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:27:50,536 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 05:27:50,544 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:50,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:50,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:50,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:50,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 05:27:50,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:50,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 05:27:50,579 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,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 05:27:50,579 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:50,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:50,579 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:50,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:50,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,615 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:50,615 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:50,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 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 05:27:50,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:50,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:50,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:50,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:27:50,769 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:50,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 05:27:50,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:50,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 05:27:50,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1223 [2022-12-06 05:27:50,769 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 05:27:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1167485612, now seen corresponding path program 1 times [2022-12-06 05:27:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:50,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195273130] [2022-12-06 05:27:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:50,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195273130] [2022-12-06 05:27:50,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195273130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:50,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:50,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205312310] [2022-12-06 05:27:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:50,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:50,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 05:27:50,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:50,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:50,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:51,109 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:51,109 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:51,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:51,123 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:51,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:51,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:51,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 05:27:51,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:51,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 05:27:51,159 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,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 05:27:51,160 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:51,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:51,160 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:51,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:51,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,191 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:51,191 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:27:51,192 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 05:27:51,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:51,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:51,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:27:51,349 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:51,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:51,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 05:27:51,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1224 [2022-12-06 05:27:51,350 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 05:27:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash 575324723, now seen corresponding path program 1 times [2022-12-06 05:27:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579302427] [2022-12-06 05:27:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:51,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 05:27:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:51,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579302427] [2022-12-06 05:27:51,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579302427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:51,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:51,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759398064] [2022-12-06 05:27:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:51,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:51,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:51,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 05:27:51,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:51,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:51,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:51,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:51,692 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:51,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:27:51,705 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:51,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:51,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:51,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 05:27:51,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:51,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 05:27:51,740 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,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 05:27:51,741 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:51,741 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:51,741 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:51,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:51,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,766 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:51,766 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:51,767 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 05:27:51,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:51,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:51,912 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:51,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:27:51,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:51,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 05:27:51,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:51,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 05:27:51,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1225 [2022-12-06 05:27:51,913 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 05:27:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1976832238, now seen corresponding path program 1 times [2022-12-06 05:27:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:51,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843923129] [2022-12-06 05:27:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:51,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 05:27:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843923129] [2022-12-06 05:27:51,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843923129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:51,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:51,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594218168] [2022-12-06 05:27:51,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:51,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:51,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:51,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:51,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:51,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 05:27:51,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:51,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:51,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:52,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:52,262 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:52,268 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 05:27:52,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:52,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:52,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:52,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 05:27:52,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:52,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:52,304 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:52,305 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:52,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:52,305 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:52,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:52,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,329 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:52,329 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:52,330 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 05:27:52,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:52,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:52,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:27:52,475 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:52,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:52,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:52,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:52,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1226 [2022-12-06 05:27:52,475 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 05:27:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -234021903, now seen corresponding path program 1 times [2022-12-06 05:27:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081379116] [2022-12-06 05:27:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:52,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 05:27:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081379116] [2022-12-06 05:27:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081379116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:52,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:52,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026646072] [2022-12-06 05:27:52,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:52,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:52,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:52,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:52,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:52,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 05:27:52,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:52,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:52,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:52,820 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:52,820 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:52,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:52,834 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:52,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:52,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:52,835 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:52,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:52,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 05:27:52,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,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 05:27:52,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:52,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:52,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:52,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:52,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:52,893 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:52,894 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 05:27:52,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:52,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:53,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:53,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:27:53,053 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:53,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 05:27:53,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:53,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 05:27:53,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1227 [2022-12-06 05:27:53,053 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 05:27:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1508788432, now seen corresponding path program 1 times [2022-12-06 05:27:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:53,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90754429] [2022-12-06 05:27:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90754429] [2022-12-06 05:27:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90754429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:53,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:53,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:53,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950422748] [2022-12-06 05:27:53,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:53,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:53,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:53,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:53,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:53,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:53,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:53,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:53,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:53,388 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:53,388 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:53,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:27:53,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:53,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:53,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:53,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 05:27:53,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:53,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 05:27:53,437 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,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 05:27:53,437 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:53,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:53,437 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:53,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:53,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,462 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:53,463 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:27:53,464 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 05:27:53,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:53,607 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:53,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:53,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:53,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 05:27:53,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:53,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 05:27:53,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1228 [2022-12-06 05:27:53,608 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 05:27:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1043368529, now seen corresponding path program 1 times [2022-12-06 05:27:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:53,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139394543] [2022-12-06 05:27:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:53,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 05:27:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:53,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139394543] [2022-12-06 05:27:53,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139394543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:53,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:53,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307401314] [2022-12-06 05:27:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:53,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:53,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:53,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:53,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:53,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 05:27:53,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:53,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:53,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:53,941 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:53,942 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:53,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 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 05:27:53,956 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:53,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:53,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:53,957 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:53,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:53,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:53,989 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,989 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:53,989 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:53,989 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:53,989 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:53,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:53,990 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:53,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,014 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:54,014 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:27:54,015 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 05:27:54,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:54,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:54,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:27:54,164 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:54,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 05:27:54,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:54,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 05:27:54,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1229 [2022-12-06 05:27:54,165 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 05:27:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 699441806, now seen corresponding path program 1 times [2022-12-06 05:27:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:54,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947368915] [2022-12-06 05:27:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:54,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 05:27:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:54,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947368915] [2022-12-06 05:27:54,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947368915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:54,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:54,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807149320] [2022-12-06 05:27:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:54,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:54,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 05:27:54,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:54,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:54,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:54,497 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:54,497 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:54,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 05:27:54,511 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:54,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:54,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:54,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 05:27:54,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:54,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:54,544 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:54,544 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:54,544 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:54,544 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,545 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:54,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:54,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,569 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:54,569 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:27:54,570 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 05:27:54,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:54,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:54,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:54,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:27:54,730 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:54,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 05:27:54,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:54,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 05:27:54,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1230 [2022-12-06 05:27:54,730 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 05:27:54,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1852715155, now seen corresponding path program 1 times [2022-12-06 05:27:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:54,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526812888] [2022-12-06 05:27:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:54,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526812888] [2022-12-06 05:27:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526812888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526640569] [2022-12-06 05:27:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:54,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:54,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:54,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:54,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:54,793 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:54,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:54,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:54,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:54,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:55,064 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:55,064 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:55,072 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 05:27:55,109 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:55,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:55,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:55,110 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:55,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:55,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 05:27:55,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,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 05:27:55,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:55,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:55,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:55,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:55,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,162 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:55,162 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:27:55,163 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 05:27:55,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:55,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:55,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 05:27:55,299 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:55,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 05:27:55,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:55,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 05:27:55,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1231 [2022-12-06 05:27:55,299 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 05:27:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -109904820, now seen corresponding path program 1 times [2022-12-06 05:27:55,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:55,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312945699] [2022-12-06 05:27:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:55,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 05:27:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:55,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312945699] [2022-12-06 05:27:55,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312945699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:55,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:55,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:55,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349107311] [2022-12-06 05:27:55,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:55,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:55,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:55,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:55,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:55,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 05:27:55,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:55,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:55,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:55,623 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:55,623 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:27:55,630 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 05:27:55,637 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:55,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:55,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:55,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:55,638 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:55,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:55,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 05:27:55,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,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 05:27:55,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:55,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:55,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:55,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:55,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,698 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:55,698 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:27:55,699 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 05:27:55,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:55,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:55,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:55,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:27:55,849 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:55,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 05:27:55,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:55,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 05:27:55,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1232 [2022-12-06 05:27:55,850 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 05:27:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1632905515, now seen corresponding path program 1 times [2022-12-06 05:27:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:55,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170381381] [2022-12-06 05:27:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:55,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:55,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 05:27:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:55,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170381381] [2022-12-06 05:27:55,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170381381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:55,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:55,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835394309] [2022-12-06 05:27:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:55,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:55,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:55,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 05:27:55,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:55,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:55,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:56,178 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:56,178 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:27:56,185 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 05:27:56,192 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:56,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:56,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:56,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 05:27:56,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:56,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 05:27:56,225 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:56,225 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:56,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:56,225 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:56,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:56,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,250 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:56,250 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:27:56,251 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 05:27:56,253 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:56,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:56,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:27:56,392 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:56,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:56,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:56,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:56,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1233 [2022-12-06 05:27:56,392 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 05:27:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash -919251446, now seen corresponding path program 1 times [2022-12-06 05:27:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832092283] [2022-12-06 05:27:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27: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 05:27:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832092283] [2022-12-06 05:27:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832092283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:56,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:56,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835453464] [2022-12-06 05:27:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:56,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:56,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27: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 05:27:56,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:56,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:56,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:56,731 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:56,731 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:27:56,738 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 05:27:56,745 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:56,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:56,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:56,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 05:27:56,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:56,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:27:56,777 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:27:56,778 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:56,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:56,778 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:56,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:56,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,802 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:56,802 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:56,803 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 05:27:56,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:56,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:56,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:56,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:27:56,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:56,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 05:27:56,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:56,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 05:27:56,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1234 [2022-12-06 05:27:56,956 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 05:27:56,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 823558889, now seen corresponding path program 1 times [2022-12-06 05:27:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:56,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022960569] [2022-12-06 05:27:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:57,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:57,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022960569] [2022-12-06 05:27:57,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022960569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:57,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63609273] [2022-12-06 05:27:57,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:57,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:57,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 05:27:57,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:57,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:57,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:57,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:57,284 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:57,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 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 05:27:57,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:57,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:57,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:57,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 05:27:57,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:57,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 05:27:57,331 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,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 05:27:57,331 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:57,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:57,331 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,331 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:57,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:57,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,356 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:57,356 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:27:57,357 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 05:27:57,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:57,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:57,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 05:27:57,499 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:57,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 05:27:57,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:57,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 05:27:57,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1235 [2022-12-06 05:27:57,499 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 05:27:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1728598072, now seen corresponding path program 1 times [2022-12-06 05:27:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:57,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654026487] [2022-12-06 05:27:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:57,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:57,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654026487] [2022-12-06 05:27:57,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654026487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:57,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:57,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935981411] [2022-12-06 05:27:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:57,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:57,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:57,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 05:27:57,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:57,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:57,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:57,826 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:57,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 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 05:27:57,840 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:57,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:57,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:57,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 05:27:57,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:57,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 05:27:57,872 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,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 05:27:57,872 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:57,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:57,872 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:57,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:57,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,896 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:57,896 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 05:27:57,897 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 05:27:57,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:57,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:58,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:58,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:27:58,039 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:58,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 05:27:58,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:58,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 05:27:58,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1236 [2022-12-06 05:27:58,039 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 05:27:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 14212263, now seen corresponding path program 1 times [2022-12-06 05:27:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:58,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552485244] [2022-12-06 05:27:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:58,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 05:27:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:58,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552485244] [2022-12-06 05:27:58,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552485244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:58,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:58,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634310586] [2022-12-06 05:27:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:58,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:58,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:58,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:58,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:58,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 05:27:58,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:58,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:58,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:58,372 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:58,373 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:27:58,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 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 05:27:58,387 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:58,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:58,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:58,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 05:27:58,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:58,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 05:27:58,422 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,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 05:27:58,422 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:58,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:58,422 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,423 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:58,423 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:58,423 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,447 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:27:58,447 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:27:58,448 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 05:27:58,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:58,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:58,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:27:58,592 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:58,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 05:27:58,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:58,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 05:27:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237 [2022-12-06 05:27:58,593 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 05:27:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1757022598, now seen corresponding path program 1 times [2022-12-06 05:27:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:58,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493353381] [2022-12-06 05:27:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:58,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493353381] [2022-12-06 05:27:58,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493353381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:58,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:58,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:58,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894270992] [2022-12-06 05:27:58,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:58,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:58,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:58,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:58,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:58,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:27:58,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:58,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:58,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:58,942 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:58,942 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:27:58,948 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 05:27:58,956 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:58,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:58,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:58,957 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:58,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:58,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 05:27:58,990 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,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 05:27:58,990 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:58,990 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:58,990 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,991 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:58,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:58,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:58,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,015 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:59,015 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:27:59,016 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 05:27:59,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:59,172 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:59,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 05:27:59,173 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:59,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 05:27:59,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:59,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 05:27:59,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1238 [2022-12-06 05:27:59,173 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 05:27:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -795134363, now seen corresponding path program 1 times [2022-12-06 05:27:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:59,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918637830] [2022-12-06 05:27:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:59,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 05:27:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:59,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918637830] [2022-12-06 05:27:59,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918637830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:59,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:59,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418949395] [2022-12-06 05:27:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:59,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:59,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:59,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 05:27:59,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:59,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:59,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:59,544 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:27:59,544 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:27:59,550 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 05:27:59,557 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:27:59,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:27:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:27:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:27:59,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:27:59,558 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:27:59,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:27:59,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 05:27:59,587 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,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 05:27:59,587 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:27:59,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:59,587 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:59,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:59,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,612 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:27:59,613 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:27:59,614 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 05:27:59,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:27:59,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:27:59,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:27:59,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 05:27:59,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:27:59,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 05:27:59,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:59,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 05:27:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1239 [2022-12-06 05:27:59,776 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 05:27:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 947675972, now seen corresponding path program 1 times [2022-12-06 05:27:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:59,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780439624] [2022-12-06 05:27:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:59,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 05:27:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:59,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780439624] [2022-12-06 05:27:59,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780439624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:59,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:59,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:27:59,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618436600] [2022-12-06 05:27:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:59,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:27:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:27:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:27:59,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:27:59,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 05:27:59,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:59,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:27:59,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:00,103 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:00,103 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:28:00,110 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 05:28:00,117 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:00,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:00,118 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:00,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 05:28:00,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:00,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 05:28:00,151 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:00,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:00,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:00,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:00,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:00,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,176 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:00,176 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:28:00,177 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 05:28:00,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:00,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:00,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:28:00,332 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:00,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 05:28:00,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:00,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 05:28:00,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1240 [2022-12-06 05:28:00,332 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 05:28:00,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:00,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1604480989, now seen corresponding path program 1 times [2022-12-06 05:28:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:00,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655655179] [2022-12-06 05:28:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:00,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655655179] [2022-12-06 05:28:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655655179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:00,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731250294] [2022-12-06 05:28:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:00,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:00,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:00,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:00,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:00,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:00,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:00,679 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:00,679 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:00,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:28:00,693 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:00,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:00,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:00,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 05:28:00,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:00,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 05:28:00,727 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:00,727 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:00,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:00,727 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,727 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:00,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:00,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,752 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:00,752 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:00,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 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 05:28:00,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:00,755 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:00,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:00,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:28:00,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:00,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 05:28:00,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:00,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 05:28:00,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1241 [2022-12-06 05:28:00,901 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 05:28:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:00,901 INFO L85 PathProgramCache]: Analyzing trace with hash 138329346, now seen corresponding path program 1 times [2022-12-06 05:28:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670985870] [2022-12-06 05:28:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:00,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670985870] [2022-12-06 05:28:00,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670985870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:00,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:00,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662689158] [2022-12-06 05:28:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:00,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:00,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:00,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 05:28:00,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:00,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:00,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:01,247 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:01,248 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:28:01,254 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 05:28:01,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:01,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:01,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:01,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:01,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:01,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:01,295 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:01,295 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:01,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:01,296 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:01,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:01,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,320 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:01,320 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 05:28:01,321 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 05:28:01,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:01,466 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:01,466 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:28:01,466 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28: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 05:28:01,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:01,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:01,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1242 [2022-12-06 05:28:01,466 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 05:28:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1881139681, now seen corresponding path program 1 times [2022-12-06 05:28:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:01,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193165606] [2022-12-06 05:28:01,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:01,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 05:28:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193165606] [2022-12-06 05:28:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193165606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:01,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:01,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298087527] [2022-12-06 05:28:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:01,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:01,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:01,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:01,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 05:28:01,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:01,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:01,799 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:01,799 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:01,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:28:01,814 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:01,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:01,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:01,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 05:28:01,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:01,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:01,848 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:01,848 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:01,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:01,848 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:01,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:01,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,873 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:01,874 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:01,875 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 05:28:01,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:01,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:02,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:02,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:28:02,020 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:02,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 05:28:02,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:02,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 05:28:02,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1243 [2022-12-06 05:28:02,020 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 05:28:02,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:02,020 INFO L85 PathProgramCache]: Analyzing trace with hash -671017280, now seen corresponding path program 1 times [2022-12-06 05:28:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:02,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137685782] [2022-12-06 05:28:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:02,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 05:28:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:02,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137685782] [2022-12-06 05:28:02,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137685782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:02,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:02,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975429145] [2022-12-06 05:28:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:02,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:02,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:02,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 05:28:02,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:02,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:02,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:02,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:02,374 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:28:02,381 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 05:28:02,388 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:02,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:02,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:02,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 05:28:02,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:02,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:02,449 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:02,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:02,449 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:02,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:02,449 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:02,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:02,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:02,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:02,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:02,474 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:02,474 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:28:02,475 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 05:28:02,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:02,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:02,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:02,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:28:02,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:02,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 05:28:02,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:02,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 05:28:02,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1244 [2022-12-06 05:28:02,627 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 05:28:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1071793055, now seen corresponding path program 1 times [2022-12-06 05:28:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:02,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038278595] [2022-12-06 05:28:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:02,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:02,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:02,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038278595] [2022-12-06 05:28:02,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038278595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:02,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:02,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824588167] [2022-12-06 05:28:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:02,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:02,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:02,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 05:28:02,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:02,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:02,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:02,964 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:02,964 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:02,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:28:02,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:02,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:02,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:02,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 05:28:02,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:03,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 05:28:03,012 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:03,013 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:03,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:03,013 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,013 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:03,013 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:03,013 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,037 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:03,038 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:28:03,039 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 05:28:03,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:03,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:03,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:03,189 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:03,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:03,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:03,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:03,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1245 [2022-12-06 05:28:03,189 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 05:28:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1480363906, now seen corresponding path program 1 times [2022-12-06 05:28:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759102631] [2022-12-06 05:28:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:03,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 05:28:03,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:03,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759102631] [2022-12-06 05:28:03,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759102631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:03,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:03,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380727515] [2022-12-06 05:28:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:03,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:03,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:03,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:03,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 05:28:03,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:03,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:03,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:03,538 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:03,538 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:03,545 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 05:28:03,553 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:03,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:03,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:03,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 05:28:03,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:03,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:03,589 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:03,589 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:03,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:03,589 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:03,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:03,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,614 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:03,614 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 05:28:03,615 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 05:28:03,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:03,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:03,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:03,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:28:03,775 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:03,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 05:28:03,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:03,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 05:28:03,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1246 [2022-12-06 05:28:03,776 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 05:28:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 262446429, now seen corresponding path program 1 times [2022-12-06 05:28:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:03,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594623421] [2022-12-06 05:28:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:03,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:03,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594623421] [2022-12-06 05:28:03,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594623421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:03,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:03,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779947245] [2022-12-06 05:28:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:03,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:03,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:03,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 05:28:03,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:03,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:03,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:04,136 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:04,136 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:28:04,142 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 05:28:04,150 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:04,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:04,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:04,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 05:28:04,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28: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 05:28:04,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:04,184 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:04,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:04,184 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:04,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:04,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,208 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:04,208 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:04,209 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 05:28:04,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:04,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:04,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:28:04,364 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:04,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 05:28:04,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:04,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 05:28:04,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1247 [2022-12-06 05:28:04,364 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 05:28:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2005256764, now seen corresponding path program 1 times [2022-12-06 05:28:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:04,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231599803] [2022-12-06 05:28:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:04,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231599803] [2022-12-06 05:28:04,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231599803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:04,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:04,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990818293] [2022-12-06 05:28:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:04,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:04,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:04,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:04,429 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:04,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:04,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:04,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:04,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:04,695 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:04,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:04,710 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:04,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:04,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:04,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 05:28:04,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:04,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 05:28:04,743 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:04,743 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:04,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:04,743 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:04,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:04,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,768 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:04,768 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:28:04,769 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 05:28:04,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:04,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:04,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:04,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:04,919 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:04,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:04,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 05:28:04,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1248 [2022-12-06 05:28:04,919 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 05:28:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -546900197, now seen corresponding path program 1 times [2022-12-06 05:28:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:04,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059418285] [2022-12-06 05:28:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:04,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059418285] [2022-12-06 05:28:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059418285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:04,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:04,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426228794] [2022-12-06 05:28:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:04,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:04,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:04,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:04,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:04,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:04,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:04,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:04,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:04,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:05,248 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:05,248 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:28:05,255 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 05:28:05,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:05,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:05,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:05,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:05,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:05,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 05:28:05,296 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,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 05:28:05,297 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:05,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:05,297 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:05,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:05,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,322 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:05,322 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:28:05,323 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 05:28:05,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:05,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:05,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:28:05,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:05,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:05,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:05,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:05,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1249 [2022-12-06 05:28:05,482 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 05:28:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1195910138, now seen corresponding path program 1 times [2022-12-06 05:28:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:05,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522770631] [2022-12-06 05:28:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:05,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:05,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522770631] [2022-12-06 05:28:05,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522770631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:05,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462160763] [2022-12-06 05:28:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:05,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:05,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:05,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:05,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:05,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:05,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:05,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:05,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:05,809 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:05,809 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:05,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 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 05:28:05,823 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:05,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:05,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:05,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 05:28:05,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:05,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 05:28:05,858 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:05,858 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:05,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:05,858 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:05,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:05,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,883 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:05,883 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:28:05,884 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 05:28:05,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:05,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:06,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:06,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:28:06,035 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:06,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:06,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:06,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 05:28:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1250 [2022-12-06 05:28:06,036 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 05:28:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1356246823, now seen corresponding path program 1 times [2022-12-06 05:28:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:06,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473631488] [2022-12-06 05:28:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:06,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473631488] [2022-12-06 05:28:06,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473631488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:06,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:06,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633714320] [2022-12-06 05:28:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:06,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:06,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:06,118 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:06,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:06,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:06,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:06,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:06,426 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:06,426 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:28:06,436 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 05:28:06,446 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:06,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:06,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:06,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:06,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 05:28:06,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:06,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 05:28:06,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:06,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 05:28:06,495 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:06,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:06,495 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:06,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:06,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:06,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:06,529 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:06,529 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:06,531 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 05:28:06,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:06,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:06,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:06,756 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 05:28:06,756 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:06,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 05:28:06,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:06,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 05:28:06,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1251 [2022-12-06 05:28:06,756 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 05:28:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 386563512, now seen corresponding path program 1 times [2022-12-06 05:28:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:06,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483823563] [2022-12-06 05:28:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:06,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 05:28:06,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:06,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483823563] [2022-12-06 05:28:06,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483823563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:06,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:06,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252174919] [2022-12-06 05:28:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:06,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:06,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:06,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:06,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:06,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:06,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:06,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:07,238 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:07,238 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:28:07,247 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 05:28:07,255 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:07,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:07,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:07,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 05:28:07,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:07,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:07,295 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:07,295 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:07,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:07,296 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:07,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:07,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,329 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:07,329 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:28:07,331 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 05:28:07,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:07,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:07,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:28:07,490 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:07,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 05:28:07,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:07,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:07,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1252 [2022-12-06 05:28:07,491 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 05:28:07,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2129373847, now seen corresponding path program 1 times [2022-12-06 05:28:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:07,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64381979] [2022-12-06 05:28:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:07,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:07,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64381979] [2022-12-06 05:28:07,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64381979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:07,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:07,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:07,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128752114] [2022-12-06 05:28:07,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:07,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:07,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:07,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:07,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:07,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:07,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:07,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:07,821 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:07,821 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:07,835 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:07,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:07,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:07,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 05:28:07,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:07,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:07,869 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,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 05:28:07,869 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:07,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:07,869 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:07,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:07,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:07,894 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:28:07,895 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 05:28:07,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:07,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:08,044 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:08,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:08,045 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:08,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 05:28:08,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:08,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 05:28:08,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1253 [2022-12-06 05:28:08,045 INFO L420 AbstractCegarLoop]: === Iteration 1255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:28:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:08,045 INFO L85 PathProgramCache]: Analyzing trace with hash -422783114, now seen corresponding path program 1 times [2022-12-06 05:28:08,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:08,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798716659] [2022-12-06 05:28:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:08,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798716659] [2022-12-06 05:28:08,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798716659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:08,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:08,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838268382] [2022-12-06 05:28:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:08,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:08,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:08,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:08,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:08,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:08,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:08,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:08,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:08,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:08,389 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:08,390 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:28:08,396 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 05:28:08,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:08,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:08,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:08,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 05:28:08,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:08,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:08,436 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:08,436 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:08,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:08,436 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:08,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:08,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,461 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:08,461 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:28:08,462 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 05:28:08,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:08,599 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:08,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 05:28:08,600 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:08,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:08,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:08,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 05:28:08,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1254 [2022-12-06 05:28:08,600 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 05:28:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1320027221, now seen corresponding path program 1 times [2022-12-06 05:28:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:08,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805305265] [2022-12-06 05:28:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:08,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805305265] [2022-12-06 05:28:08,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805305265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:08,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:08,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675400310] [2022-12-06 05:28:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:08,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:08,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:08,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:08,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:08,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:08,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:08,933 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:08,933 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:28:08,939 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 05:28:08,947 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:08,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:08,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:08,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 05:28:08,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:08,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:08,979 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:08,979 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:08,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:08,979 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:08,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:08,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:08,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,004 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:09,004 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 05:28:09,005 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 05:28:09,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:09,158 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:09,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 05:28:09,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:09,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 05:28:09,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:09,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 05:28:09,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1255 [2022-12-06 05:28:09,158 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 05:28:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1232129740, now seen corresponding path program 1 times [2022-12-06 05:28:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:09,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713117613] [2022-12-06 05:28:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:09,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 05:28:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713117613] [2022-12-06 05:28:09,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713117613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:09,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:09,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77290174] [2022-12-06 05:28:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:09,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:09,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:09,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 05:28:09,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:09,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:09,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:09,485 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:09,485 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:09,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 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 05:28:09,498 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:09,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:09,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:09,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 05:28:09,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:09,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 05:28:09,530 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:09,530 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:09,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:09,530 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,530 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:09,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:09,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,554 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:09,554 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:28:09,555 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 05:28:09,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:09,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:09,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:09,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 05:28:09,705 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:09,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 05:28:09,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:09,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:09,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1256 [2022-12-06 05:28:09,706 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 05:28:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash 510680595, now seen corresponding path program 1 times [2022-12-06 05:28:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:09,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557958456] [2022-12-06 05:28:09,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:09,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 05:28:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:09,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557958456] [2022-12-06 05:28:09,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557958456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:09,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:09,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829018912] [2022-12-06 05:28:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:09,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:09,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:09,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 05:28:09,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:09,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:09,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:10,030 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:10,030 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:28:10,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 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 05:28:10,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:10,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:10,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:10,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 05:28:10,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:10,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 05:28:10,105 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,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 05:28:10,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:10,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:10,105 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:10,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:10,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,130 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:10,130 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:10,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 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 05:28:10,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:10,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:10,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:28:10,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:10,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 05:28:10,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:10,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 05:28:10,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1257 [2022-12-06 05:28:10,293 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 05:28:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2041476366, now seen corresponding path program 1 times [2022-12-06 05:28:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:10,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991916232] [2022-12-06 05:28:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:10,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 05:28:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991916232] [2022-12-06 05:28:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991916232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490232955] [2022-12-06 05:28:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:10,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:10,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 05:28:10,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:10,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:10,635 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:10,636 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:10,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:10,650 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:10,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:10,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:10,651 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:10,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:10,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 05:28:10,684 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:10,685 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:10,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:10,685 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:10,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:10,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,710 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:10,710 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:10,711 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 05:28:10,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:10,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:10,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:10,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:28:10,862 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:10,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 05:28:10,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:10,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 05:28:10,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1258 [2022-12-06 05:28:10,862 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 05:28:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash -298666031, now seen corresponding path program 1 times [2022-12-06 05:28:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:10,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703123802] [2022-12-06 05:28:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:10,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 05:28:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:10,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703123802] [2022-12-06 05:28:10,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703123802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:10,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:10,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840223292] [2022-12-06 05:28:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:10,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:10,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:10,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:10,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 05:28:10,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:10,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:10,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:11,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:11,210 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:28:11,217 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 05:28:11,224 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:11,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:11,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:11,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 05:28:11,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:11,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 05:28:11,255 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:11,255 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:11,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:11,256 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:11,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:11,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,281 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:11,281 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:28:11,282 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 05:28:11,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:11,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:11,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 05:28:11,446 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:11,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 05:28:11,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:11,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 05:28:11,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1259 [2022-12-06 05:28:11,446 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 05:28:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1444144304, now seen corresponding path program 1 times [2022-12-06 05:28:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:11,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290306516] [2022-12-06 05:28:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:11,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 05:28:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:11,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290306516] [2022-12-06 05:28:11,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290306516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:11,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:11,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108915270] [2022-12-06 05:28:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:11,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:11,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:11,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 05:28:11,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:11,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:11,791 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:11,791 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:11,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:11,805 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:11,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:11,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:11,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 05:28:11,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:11,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 05:28:11,837 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:11,837 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:11,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:11,837 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:11,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:11,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,862 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:11,862 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:28:11,863 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 05:28:11,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:11,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:12,003 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:12,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:28:12,004 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:12,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 05:28:12,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:12,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 05:28:12,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1260 [2022-12-06 05:28:12,004 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 05:28:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1108012657, now seen corresponding path program 1 times [2022-12-06 05:28:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:12,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270881846] [2022-12-06 05:28:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:12,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270881846] [2022-12-06 05:28:12,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270881846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:12,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:12,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:12,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257068800] [2022-12-06 05:28:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:12,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:12,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:12,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 05:28:12,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:12,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:12,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:12,339 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:12,339 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:28:12,345 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 05:28:12,353 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:12,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:12,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:12,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 05:28:12,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:12,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 05:28:12,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,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 05:28:12,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:12,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:12,387 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:12,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:12,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,411 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:12,412 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:28:12,413 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 05:28:12,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:12,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:12,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:28:12,561 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:12,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:12,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:12,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:12,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1261 [2022-12-06 05:28:12,561 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 05:28:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 634797678, now seen corresponding path program 1 times [2022-12-06 05:28:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:12,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189649021] [2022-12-06 05:28:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:12,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 05:28:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:12,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189649021] [2022-12-06 05:28:12,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189649021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:12,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:12,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771135905] [2022-12-06 05:28:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:12,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:12,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:12,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 05:28:12,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:12,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:12,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:12,884 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:12,885 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:12,891 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 05:28:12,898 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:12,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:12,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:12,898 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:12,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:12,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 05:28:12,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,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 05:28:12,929 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:12,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:12,929 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:12,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:12,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:12,953 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:12,954 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 05:28:12,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:12,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:13,094 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:13,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 05:28:13,094 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:13,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 05:28:13,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:13,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 05:28:13,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262 [2022-12-06 05:28:13,094 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 05:28:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1917359283, now seen corresponding path program 1 times [2022-12-06 05:28:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:13,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894549421] [2022-12-06 05:28:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:13,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894549421] [2022-12-06 05:28:13,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894549421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:13,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:13,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096103100] [2022-12-06 05:28:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:13,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:13,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:13,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:13,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:13,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:13,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:13,444 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:13,445 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:28:13,451 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 05:28:13,458 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:13,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:13,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:13,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 05:28:13,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:13,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 05:28:13,492 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:13,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 05:28:13,493 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:13,493 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:13,493 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:13,493 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:13,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:13,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:13,518 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:13,518 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:28:13,519 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 05:28:13,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:13,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:13,656 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:13,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 05:28:13,657 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:13,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 05:28:13,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:13,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 05:28:13,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263 [2022-12-06 05:28:13,657 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 05:28:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash -174548948, now seen corresponding path program 1 times [2022-12-06 05:28:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:13,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33817925] [2022-12-06 05:28:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:13,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33817925] [2022-12-06 05:28:13,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33817925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:13,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:13,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453895804] [2022-12-06 05:28:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:13,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:13,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 05:28:13,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:13,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:13,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:14,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:14,000 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:14,007 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 05:28:14,014 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:14,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:14,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:14,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 05:28:14,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:14,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 05:28:14,047 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,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 05:28:14,047 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:14,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:14,047 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:14,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:14,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,072 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:14,072 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 05:28:14,073 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 05:28:14,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:14,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:14,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:28:14,220 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:14,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 05:28:14,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:14,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 05:28:14,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1264 [2022-12-06 05:28:14,220 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 05:28:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1568261387, now seen corresponding path program 1 times [2022-12-06 05:28:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:14,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268048511] [2022-12-06 05:28:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:14,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 05:28:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:14,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268048511] [2022-12-06 05:28:14,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268048511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:14,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:14,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791801245] [2022-12-06 05:28:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:14,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:14,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 05:28:14,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:14,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:14,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:14,573 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:14,574 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:28:14,579 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 05:28:14,585 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:14,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:14,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:14,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:14,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 05:28:14,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:14,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:14,614 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:14,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:14,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:14,614 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:14,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:14,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,639 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:14,639 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:14,640 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 05:28:14,642 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:14,642 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:14,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:14,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 05:28:14,791 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:14,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 05:28:14,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:14,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 05:28:14,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1265 [2022-12-06 05:28:14,791 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 05:28:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -983895574, now seen corresponding path program 1 times [2022-12-06 05:28:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:14,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552299463] [2022-12-06 05:28:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:14,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552299463] [2022-12-06 05:28:14,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552299463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:14,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:14,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717802590] [2022-12-06 05:28:14,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:14,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:14,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:14,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:14,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:14,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:14,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:14,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:15,120 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:15,121 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:15,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 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 05:28:15,135 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:15,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:15,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:15,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 05:28:15,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:15,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 05:28:15,170 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,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 05:28:15,170 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:15,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:15,170 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:15,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:15,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,194 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:15,194 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:28:15,196 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 05:28:15,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:15,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:15,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:28:15,339 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:15,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 05:28:15,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:15,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 05:28:15,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1266 [2022-12-06 05:28:15,340 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 05:28:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash 758914761, now seen corresponding path program 1 times [2022-12-06 05:28:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:15,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662364962] [2022-12-06 05:28:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:15,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 05:28:15,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:15,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662364962] [2022-12-06 05:28:15,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662364962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:15,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:15,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372590508] [2022-12-06 05:28:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:15,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:15,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:15,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:15,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 05:28:15,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:15,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:15,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:15,681 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:15,681 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:15,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 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 05:28:15,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:15,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:15,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:15,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 05:28:15,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:15,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 05:28:15,728 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,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 05:28:15,728 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:15,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:15,728 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:15,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:15,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,752 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:15,753 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 05:28:15,754 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 05:28:15,755 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:15,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:15,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:15,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:28:15,900 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:15,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:15,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:15,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 05:28:15,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1267 [2022-12-06 05:28:15,901 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 05:28:15,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1793242200, now seen corresponding path program 1 times [2022-12-06 05:28:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:15,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802449355] [2022-12-06 05:28:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802449355] [2022-12-06 05:28:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802449355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:15,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:15,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115330649] [2022-12-06 05:28:15,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:15,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:15,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:15,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:15,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:15,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:15,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:16,254 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:16,254 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:28:16,261 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 05:28:16,268 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:16,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:16,269 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:16,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 05:28:16,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28: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 05:28:16,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:16,301 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:16,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:16,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:16,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:16,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,328 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:16,328 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:28:16,330 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 05:28:16,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:16,478 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:16,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:16,478 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:16,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 05:28:16,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:16,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 05:28:16,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1268 [2022-12-06 05:28:16,479 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 05:28:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash -50431865, now seen corresponding path program 1 times [2022-12-06 05:28:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115100725] [2022-12-06 05:28:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:16,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 05:28:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:16,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115100725] [2022-12-06 05:28:16,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115100725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:16,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:16,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:16,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764560828] [2022-12-06 05:28:16,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:16,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:16,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:16,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:16,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 05:28:16,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:16,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:16,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:16,829 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:16,829 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:28:16,836 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 05:28:16,843 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:16,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:16,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:16,844 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:16,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:16,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 05:28:16,874 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,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 05:28:16,875 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:16,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:16,875 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,875 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:16,875 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:16,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,899 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:16,899 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:28:16,900 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 05:28:16,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:16,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:17,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:17,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:28:17,047 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:17,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 05:28:17,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:17,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 05:28:17,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1269 [2022-12-06 05:28:17,048 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 05:28:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1692378470, now seen corresponding path program 1 times [2022-12-06 05:28:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:17,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128427677] [2022-12-06 05:28:17,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28: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 05:28:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:17,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128427677] [2022-12-06 05:28:17,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128427677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:17,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:17,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268652667] [2022-12-06 05:28:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:17,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:17,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:17,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:17,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:17,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:17,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:17,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:17,425 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:28:17,431 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 05:28:17,437 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:17,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:17,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:17,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 05:28:17,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:17,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 05:28:17,467 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:17,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:17,467 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:17,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:17,467 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:17,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:17,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:17,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:17,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:17,492 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:17,492 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:28:17,493 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 05:28:17,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:17,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:17,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:17,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:17,643 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:17,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 05:28:17,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:17,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 05:28:17,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1270 [2022-12-06 05:28:17,644 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 05:28:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -859778491, now seen corresponding path program 1 times [2022-12-06 05:28:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:17,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796184234] [2022-12-06 05:28:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:17,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 05:28:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796184234] [2022-12-06 05:28:17,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796184234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:17,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:17,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215741130] [2022-12-06 05:28:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:17,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:17,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:17,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 05:28:17,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:17,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:17,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:17,985 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:17,985 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:28:17,992 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 05:28:17,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:17,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:18,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:18,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 05:28:18,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28: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 05:28:18,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:18,030 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:18,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:18,031 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:18,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:18,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,055 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:18,055 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 05:28:18,056 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 05:28:18,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:18,211 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:18,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:28:18,212 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:18,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 05:28:18,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:18,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 05:28:18,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1271 [2022-12-06 05:28:18,212 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 05:28:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash 883031844, now seen corresponding path program 1 times [2022-12-06 05:28:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:18,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620120196] [2022-12-06 05:28:18,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:18,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 05:28:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:18,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620120196] [2022-12-06 05:28:18,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620120196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:18,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:18,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391296825] [2022-12-06 05:28:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:18,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:18,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:18,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 05:28:18,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:18,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:18,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:18,543 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:18,543 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:18,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 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 05:28:18,558 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:18,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:18,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:18,559 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:18,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:18,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:18,592 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,592 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:18,592 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:18,592 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:18,592 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:18,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:18,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,617 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:18,617 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:28:18,618 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 05:28:18,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:18,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:18,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:18,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:28:18,780 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:18,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 05:28:18,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:18,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 05:28:18,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1272 [2022-12-06 05:28:18,780 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 05:28:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1669125117, now seen corresponding path program 1 times [2022-12-06 05:28:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:18,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125922755] [2022-12-06 05:28:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:18,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 05:28:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:18,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125922755] [2022-12-06 05:28:18,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125922755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:18,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:18,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522856060] [2022-12-06 05:28:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:18,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:18,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:18,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 05:28:18,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:18,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:18,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:19,121 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:19,122 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:19,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 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 05:28:19,136 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:19,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:19,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:19,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 05:28:19,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:19,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 05:28:19,168 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,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 05:28:19,168 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:19,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:19,168 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:19,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:19,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,193 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:19,193 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:19,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 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 05:28:19,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:19,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:19,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 05:28:19,346 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:19,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 05:28:19,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:19,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 05:28:19,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1273 [2022-12-06 05:28:19,347 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 05:28:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash 73685218, now seen corresponding path program 1 times [2022-12-06 05:28:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:19,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384552111] [2022-12-06 05:28:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:19,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 05:28:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384552111] [2022-12-06 05:28:19,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384552111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:19,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:19,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635083131] [2022-12-06 05:28:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:19,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:19,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:19,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 05:28:19,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:19,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:19,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:19,697 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:19,697 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:19,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:28:19,711 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:19,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:19,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:19,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 05:28:19,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:19,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 05:28:19,745 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:19,746 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:19,746 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:19,746 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:19,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:19,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,770 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:19,771 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:19,772 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 05:28:19,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:19,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:19,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:19,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 05:28:19,931 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:19,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:19,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:19,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:19,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1274 [2022-12-06 05:28:19,932 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 05:28:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1816495553, now seen corresponding path program 1 times [2022-12-06 05:28:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923873054] [2022-12-06 05:28:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:20,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923873054] [2022-12-06 05:28:20,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923873054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:20,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:20,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258690582] [2022-12-06 05:28:20,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:20,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:20,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:20,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:20,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:20,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:20,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:20,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:20,275 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:28:20,281 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 05:28:20,288 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:20,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:20,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:20,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 05:28:20,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:20,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:20,320 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,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 05:28:20,321 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:20,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:20,321 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:20,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:20,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,356 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:20,356 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 05:28:20,357 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 05:28:20,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:20,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:20,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 05:28:20,507 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:20,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 05:28:20,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:20,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 05:28:20,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1275 [2022-12-06 05:28:20,508 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 05:28:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash -735661408, now seen corresponding path program 1 times [2022-12-06 05:28:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108944139] [2022-12-06 05:28:20,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05: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 05:28:20,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:20,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108944139] [2022-12-06 05:28:20,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108944139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:20,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:20,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55331679] [2022-12-06 05:28:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:20,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:20,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 05:28:20,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:20,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:20,842 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:20,843 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:28:20,854 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 05:28:20,863 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:20,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:20,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:20,864 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:20,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:20,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 05:28:20,908 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,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 05:28:20,909 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:20,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:20,909 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:20,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:20,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,938 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:20,938 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 05:28:20,939 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 05:28:20,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:20,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:21,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:21,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 05:28:21,113 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:21,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:21,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:21,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1276 [2022-12-06 05:28:21,114 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 05:28:21,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148927, now seen corresponding path program 1 times [2022-12-06 05:28:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:21,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483117269] [2022-12-06 05:28:21,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:21,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:21,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483117269] [2022-12-06 05:28:21,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483117269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:21,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:21,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230569349] [2022-12-06 05:28:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:21,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:21,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:21,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 05:28:21,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:21,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:21,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:21,479 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:21,479 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:21,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:21,494 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:21,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:21,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:21,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 05:28:21,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:21,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 05:28:21,528 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:21,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 05:28:21,528 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:21,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:21,528 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:21,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:21,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:21,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:21,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:21,553 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:21,554 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 05:28:21,555 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 05:28:21,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:21,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:21,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:21,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:28:21,708 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:21,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 05:28:21,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:21,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 05:28:21,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1277 [2022-12-06 05:28:21,709 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 05:28:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1545008034, now seen corresponding path program 1 times [2022-12-06 05:28:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:21,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548395235] [2022-12-06 05:28:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:21,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 05:28:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:21,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548395235] [2022-12-06 05:28:21,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548395235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:21,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:21,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722588815] [2022-12-06 05:28:21,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:21,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:21,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:21,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:21,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 05:28:21,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:21,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:21,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:22,142 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:22,142 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:22,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:22,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:22,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:22,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:22,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 05:28:22,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:22,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 05:28:22,203 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:22,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:22,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:22,203 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:22,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:22,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,237 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:22,237 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:22,239 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 05:28:22,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:22,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:22,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:28:22,384 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:22,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 05:28:22,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:22,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 05:28:22,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1278 [2022-12-06 05:28:22,384 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 05:28:22,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash 197802301, now seen corresponding path program 1 times [2022-12-06 05:28:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:22,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29999464] [2022-12-06 05:28:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:22,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:22,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:22,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29999464] [2022-12-06 05:28:22,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29999464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:22,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:22,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149488951] [2022-12-06 05:28:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:22,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:22,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:22,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 05:28:22,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:22,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:22,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:22,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:22,719 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 05:28:22,725 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 05:28:22,732 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:22,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:22,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:22,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 05:28:22,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:22,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 05:28:22,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,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 05:28:22,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:22,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:22,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:22,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:22,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,786 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:22,786 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:28:22,787 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 05:28:22,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:22,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:22,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:22,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:22,938 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:22,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 05:28:22,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:22,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 05:28:22,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1279 [2022-12-06 05:28:22,938 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 05:28:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1940612636, now seen corresponding path program 1 times [2022-12-06 05:28:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:22,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428491115] [2022-12-06 05:28:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:23,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 05:28:23,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:23,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428491115] [2022-12-06 05:28:23,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428491115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:23,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:23,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419048999] [2022-12-06 05:28:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:23,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:23,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:23,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 05:28:23,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:23,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:23,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:23,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:23,303 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 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 05:28:23,317 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:23,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:23,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:23,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 05:28:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:23,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:23,349 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:23,350 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:23,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:23,350 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:23,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:23,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,374 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:23,374 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 05:28:23,375 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 05:28:23,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:23,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:23,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 05:28:23,542 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:23,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:23,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:23,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:23,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1280 [2022-12-06 05:28:23,542 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 05:28:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash -611544325, now seen corresponding path program 1 times [2022-12-06 05:28:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:23,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735915881] [2022-12-06 05:28:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:23,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 05:28:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:23,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735915881] [2022-12-06 05:28:23,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735915881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:23,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:23,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897369071] [2022-12-06 05:28:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:23,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:23,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:23,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 05:28:23,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:23,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:23,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:23,884 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:23,884 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:28:23,899 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:23,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:23,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:23,899 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:23,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:23,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 05:28:23,934 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:23,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:23,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:23,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:23,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:23,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,959 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:23,959 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 05:28:23,960 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 05:28:23,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:23,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:24,118 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:24,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 05:28:24,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:24,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 05:28:24,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:24,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:24,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1281 [2022-12-06 05:28:24,119 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 05:28:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1131266010, now seen corresponding path program 1 times [2022-12-06 05:28:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:24,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606598845] [2022-12-06 05:28:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:24,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 05:28:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606598845] [2022-12-06 05:28:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606598845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:24,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:24,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618229366] [2022-12-06 05:28:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:24,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:24,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:24,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:24,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:24,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 05:28:24,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:24,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:24,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:24,473 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:24,473 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 05:28:24,480 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 05:28:24,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:24,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:24,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:24,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 05:28:24,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:24,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:24,522 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:24,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:24,522 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:24,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:24,523 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:24,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:24,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:24,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:24,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:24,548 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:24,548 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:24,549 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 05:28:24,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:24,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:24,692 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:24,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 05:28:24,693 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:24,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 05:28:24,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:24,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 05:28:24,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1282 [2022-12-06 05:28:24,693 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 05:28:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1420890951, now seen corresponding path program 1 times [2022-12-06 05:28:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529559454] [2022-12-06 05:28:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:24,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 05:28:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:24,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529559454] [2022-12-06 05:28:24,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529559454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:24,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:24,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438309747] [2022-12-06 05:28:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:24,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:24,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:24,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 05:28:24,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:24,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:24,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:25,049 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:25,049 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 05:28:25,054 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 05:28:25,060 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:25,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:25,061 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:25,061 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:25,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:25,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 05:28:25,086 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,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 05:28:25,087 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:25,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:25,087 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:25,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:25,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,111 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:25,111 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:28:25,112 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 05:28:25,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:25,268 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:25,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:28:25,268 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28: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 05:28:25,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:25,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 05:28:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1283 [2022-12-06 05:28:25,269 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 05:28:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash 321919384, now seen corresponding path program 1 times [2022-12-06 05:28:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:25,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410182153] [2022-12-06 05:28:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:25,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410182153] [2022-12-06 05:28:25,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410182153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:25,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:25,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903683268] [2022-12-06 05:28:25,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:25,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:25,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:25,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 05:28:25,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:25,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:25,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:25,596 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:25,596 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:25,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 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 05:28:25,610 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:25,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:25,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:25,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 05:28:25,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:25,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 05:28:25,645 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,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 05:28:25,645 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:25,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:25,645 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,646 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:25,646 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:25,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,670 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:25,670 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 05:28:25,671 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 05:28:25,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:25,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:25,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:25,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:28:25,826 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:25,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:25,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:25,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:25,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1284 [2022-12-06 05:28:25,826 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 05:28:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2064729719, now seen corresponding path program 1 times [2022-12-06 05:28:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:25,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549390746] [2022-12-06 05:28:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:25,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 05:28:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:25,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549390746] [2022-12-06 05:28:25,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549390746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:25,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:25,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093512146] [2022-12-06 05:28:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:25,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:25,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:25,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 05:28:25,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:25,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:25,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:26,182 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:26,182 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:28:26,188 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 05:28:26,195 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:26,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:26,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:26,196 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:26,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:26,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 05:28:26,228 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,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 05:28:26,228 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:26,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:26,229 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,229 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:26,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:26,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,253 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:26,253 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 05:28:26,254 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 05:28:26,256 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:26,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:26,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 05:28:26,401 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:26,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:26,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:26,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1285 [2022-12-06 05:28:26,401 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 05:28:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -487427242, now seen corresponding path program 1 times [2022-12-06 05:28:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:26,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804881970] [2022-12-06 05:28:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:26,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 05:28:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:26,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804881970] [2022-12-06 05:28:26,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804881970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:26,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:26,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319600410] [2022-12-06 05:28:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:26,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:26,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:26,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 05:28:26,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:26,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:26,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:26,751 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:26,751 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:26,758 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 05:28:26,765 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:26,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:26,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:26,766 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:26,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:26,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 05:28:26,798 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,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 05:28:26,799 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:26,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:26,799 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,799 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:26,799 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:26,799 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,823 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:26,824 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:26,825 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 05:28:26,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:26,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:26,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:26,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:28:26,970 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:26,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 05:28:26,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:26,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 05:28:26,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1286 [2022-12-06 05:28:26,970 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 05:28:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1255383093, now seen corresponding path program 1 times [2022-12-06 05:28:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:26,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025620273] [2022-12-06 05:28:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:27,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025620273] [2022-12-06 05:28:27,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025620273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:27,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:27,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136922171] [2022-12-06 05:28:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:27,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:27,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:27,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:27,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:27,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:27,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:27,302 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:27,302 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:28:27,309 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 05:28:27,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:27,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:27,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:27,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 05:28:27,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:27,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:27,349 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:27,350 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:27,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:27,350 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:27,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:27,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,375 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:27,375 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:27,376 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 05:28:27,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:27,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:27,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:27,526 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:27,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 05:28:27,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:27,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 05:28:27,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1287 [2022-12-06 05:28:27,526 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 05:28:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1296773868, now seen corresponding path program 1 times [2022-12-06 05:28:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:27,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175329663] [2022-12-06 05:28:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175329663] [2022-12-06 05:28:27,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175329663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:27,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:27,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174522781] [2022-12-06 05:28:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:27,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:27,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:27,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:27,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:27,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:27,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:27,857 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:27,857 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 05:28:27,864 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 05:28:27,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:27,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:27,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:27,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 05:28:27,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:27,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:27,904 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:27,904 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:27,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:27,904 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:27,905 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:27,905 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,940 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:27,940 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:28:27,941 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 05:28:27,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:27,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:28,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:28,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:28:28,080 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:28,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:28,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:28,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1288 [2022-12-06 05:28:28,080 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 05:28:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash 446036467, now seen corresponding path program 1 times [2022-12-06 05:28:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:28,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282973509] [2022-12-06 05:28:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:28,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:28,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 05:28:28,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282973509] [2022-12-06 05:28:28,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282973509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:28,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:28,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:28,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435353557] [2022-12-06 05:28:28,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:28,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:28,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:28,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:28,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 05:28:28,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:28,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:28,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:28,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:28,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:28,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 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 05:28:28,438 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:28,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:28,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:28,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 05:28:28,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:28,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 05:28:28,472 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:28,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 05:28:28,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:28,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:28,473 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:28,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:28,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:28,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:28,497 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:28,497 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:28:28,499 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 05:28:28,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:28,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:28,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:28,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:28:28,652 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:28,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 05:28:28,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:28,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 05:28:28,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1289 [2022-12-06 05:28:28,653 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 05:28:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2106120494, now seen corresponding path program 1 times [2022-12-06 05:28:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:28,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305385593] [2022-12-06 05:28:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:28,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 05:28:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305385593] [2022-12-06 05:28:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305385593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:28,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:28,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110015687] [2022-12-06 05:28:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:28,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:28,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 05:28:28,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:28,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:28,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:28,977 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:28,978 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:28,984 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 05:28:28,991 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:28,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:28,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:28,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 05:28:28,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28: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 05:28:29,024 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:29,025 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:29,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:29,025 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:29,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:29,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,049 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:29,049 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:28:29,050 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 05:28:29,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:29,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:29,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 05:28:29,191 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:29,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:29,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:29,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:29,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1290 [2022-12-06 05:28:29,192 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 05:28:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash -363310159, now seen corresponding path program 1 times [2022-12-06 05:28:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:29,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702872507] [2022-12-06 05:28:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:29,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:29,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702872507] [2022-12-06 05:28:29,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702872507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:29,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:29,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850997718] [2022-12-06 05:28:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:29,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:29,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:29,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:29,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:29,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:29,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:29,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:29,536 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:29,536 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 05:28:29,542 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 05:28:29,548 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:29,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:29,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:29,549 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:29,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:29,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 05:28:29,579 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,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 05:28:29,580 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:29,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:29,580 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:29,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:29,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:29,604 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 05:28:29,605 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 05:28:29,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:29,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:29,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:29,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 05:28:29,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:29,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:29,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:29,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:29,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1291 [2022-12-06 05:28:29,751 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 05:28:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1379500176, now seen corresponding path program 1 times [2022-12-06 05:28:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:29,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103167315] [2022-12-06 05:28:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:29,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:29,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 05:28:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:29,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103167315] [2022-12-06 05:28:29,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103167315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:29,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:29,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649625366] [2022-12-06 05:28:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:29,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:29,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:29,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 05:28:29,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:29,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:29,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:30,089 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:30,089 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:30,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 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 05:28:30,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:30,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:30,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:30,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 05:28:30,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:30,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:30,138 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:30,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:30,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:30,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:30,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:30,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,163 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:30,164 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 05:28:30,165 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 05:28:30,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:30,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:30,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 05:28:30,325 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:30,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 05:28:30,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:30,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 05:28:30,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292 [2022-12-06 05:28:30,325 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 05:28:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1172656785, now seen corresponding path program 1 times [2022-12-06 05:28:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:30,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512605161] [2022-12-06 05:28:30,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512605161] [2022-12-06 05:28:30,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512605161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:30,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:30,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511529469] [2022-12-06 05:28:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:30,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:30,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:30,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:30,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:30,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:30,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:30,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:30,670 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:30,670 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:30,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 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 05:28:30,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:30,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:30,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:30,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 05:28:30,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:30,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 05:28:30,716 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,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 05:28:30,717 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:30,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:30,717 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:30,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:30,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,742 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:30,742 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 05:28:30,743 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 05:28:30,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:30,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:30,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:30,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 05:28:30,897 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:30,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 05:28:30,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:30,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 05:28:30,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1293 [2022-12-06 05:28:30,897 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 05:28:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 570153550, now seen corresponding path program 1 times [2022-12-06 05:28:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:30,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611012920] [2022-12-06 05:28:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:30,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 05:28:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:30,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611012920] [2022-12-06 05:28:30,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611012920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:30,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:30,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451973488] [2022-12-06 05:28:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:30,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:30,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:30,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 05:28:30,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:30,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:31,246 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:31,246 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:31,253 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 05:28:31,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:31,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:31,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:31,261 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:31,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:31,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 05:28:31,295 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 05:28:31,295 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:31,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:31,295 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:31,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:31,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,320 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:31,320 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:28:31,321 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 05:28:31,323 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:31,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:31,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 05:28:31,464 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:31,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 05:28:31,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:31,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 05:28:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1294 [2022-12-06 05:28:31,465 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 05:28:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1982003411, now seen corresponding path program 1 times [2022-12-06 05:28:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:31,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686368465] [2022-12-06 05:28:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:31,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 05:28:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:31,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686368465] [2022-12-06 05:28:31,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686368465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:31,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:31,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025903267] [2022-12-06 05:28:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:31,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:31,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:31,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:31,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 05:28:31,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:31,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:31,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:31,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:31,796 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 05:28:31,803 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 05:28:31,810 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:31,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:31,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:31,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:28:31,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:31,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 05:28:31,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,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 05:28:31,844 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:31,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:31,844 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:31,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:31,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,869 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:31,869 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 05:28:31,870 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 05:28:31,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:31,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:32,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:32,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 05:28:32,018 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28: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 05:28:32,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28: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 05:28:32,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1295 [2022-12-06 05:28:32,018 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 05:28:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -239193076, now seen corresponding path program 1 times [2022-12-06 05:28:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:32,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661653432] [2022-12-06 05:28:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661653432] [2022-12-06 05:28:32,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661653432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:32,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:32,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469409264] [2022-12-06 05:28:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:32,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:32,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:32,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 05:28:32,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:32,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:32,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:32,392 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:32,392 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 05:28:32,398 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 05:28:32,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:32,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:32,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:32,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:32,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 05:28:32,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:32,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 05:28:32,432 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:32,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 05:28:32,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:32,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:32,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:32,432 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:32,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:32,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:32,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:32,457 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:32,457 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 05:28:32,458 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 05:28:32,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:32,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:32,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:32,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 05:28:32,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:32,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 05:28:32,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:32,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 05:28:32,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1296 [2022-12-06 05:28:32,613 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 05:28:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1503617259, now seen corresponding path program 1 times [2022-12-06 05:28:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:32,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973960069] [2022-12-06 05:28:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:32,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 05:28:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:32,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973960069] [2022-12-06 05:28:32,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973960069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:32,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:32,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635030634] [2022-12-06 05:28:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:32,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:32,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:32,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:32,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 05:28:32,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:32,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:32,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:32,960 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:32,960 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:32,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 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 05:28:32,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:32,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:32,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:32,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 05:28:32,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:33,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 05:28:33,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,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 05:28:33,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:33,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:33,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:33,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:33,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,032 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:33,032 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 05:28:33,033 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 05:28:33,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:33,174 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:33,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 05:28:33,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:33,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 05:28:33,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:33,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 05:28:33,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1297 [2022-12-06 05:28:33,175 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 05:28:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1048539702, now seen corresponding path program 1 times [2022-12-06 05:28:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:33,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297211295] [2022-12-06 05:28:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:33,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 05:28:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:33,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297211295] [2022-12-06 05:28:33,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297211295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:33,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:33,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970096581] [2022-12-06 05:28:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:33,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:33,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:33,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:33,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 05:28:33,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:33,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:33,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:33,533 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:33,533 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 05:28:33,540 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 05:28:33,547 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:33,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:33,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:33,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 05:28:33,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28: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 05:28:33,581 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:33,581 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:33,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:33,581 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:33,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:33,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,606 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 05:28:33,606 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 05:28:33,607 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 05:28:33,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:33,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 05:28:33,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:28:33,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 05:28:33,771 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 05:28:33,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 05:28:33,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:33,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 05:28:33,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1298 [2022-12-06 05:28:33,771 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 05:28:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 694270633, now seen corresponding path program 1 times [2022-12-06 05:28:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:33,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857914939] [2022-12-06 05:28:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:33,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 05:28:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:33,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857914939] [2022-12-06 05:28:33,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857914939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:33,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:33,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:28:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181794834] [2022-12-06 05:28:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:33,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:28:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:28:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:28:33,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:28:33,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:28:33,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:33,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:28:33,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:28:34,118 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 05:28:34,118 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 05:28:34,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 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 05:28:34,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 05:28:34,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:28:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:28:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:28:34,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 05:28:34,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 05:28:34,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 05:28:34,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:28:34,166 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28: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 05:28:34,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 05:28:34,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:34,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:34,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:34,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:34,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:34,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:34,191 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 05:28:34,191 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 05:28:34,192 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 05:28:34,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 05:28:34,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 Received shutdown request... [2022-12-06 05:28:34,295 WARN L249 SmtUtils]: Removed 18 from assertion stack [2022-12-06 05:28:34,296 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:28:34,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1299 [2022-12-06 05:28:34,296 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 52 for 35ms.. [2022-12-06 05:28:34,297 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:28:34,297 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:28:34,297 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:28:34,298 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] [2022-12-06 05:28:34,301 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:28:34,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:28:34,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:28:34 BasicIcfg [2022-12-06 05:28:34,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:28:34,303 INFO L158 Benchmark]: Toolchain (without parser) took 762764.46ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 983.6MB). Free memory was 146.3MB in the beginning and 858.4MB in the end (delta: -712.1MB). Peak memory consumption was 272.9MB. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.42ms. Allocated memory is still 184.5MB. Free memory was 146.3MB in the beginning and 135.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 133.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L158 Benchmark]: Boogie Preprocessor took 32.86ms. Allocated memory is still 184.5MB. Free memory was 133.5MB in the beginning and 132.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L158 Benchmark]: RCFGBuilder took 401.37ms. Allocated memory is still 184.5MB. Free memory was 132.5MB in the beginning and 118.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L158 Benchmark]: TraceAbstraction took 762009.95ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 983.6MB). Free memory was 117.8MB in the beginning and 858.4MB in the end (delta: -740.5MB). Peak memory consumption was 244.6MB. Max. memory is 8.0GB. [2022-12-06 05:28:34,303 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 160.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.42ms. Allocated memory is still 184.5MB. Free memory was 146.3MB in the beginning and 135.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 184.5MB. Free memory was 135.1MB in the beginning and 133.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.86ms. Allocated memory is still 184.5MB. Free memory was 133.5MB in the beginning and 132.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 401.37ms. Allocated memory is still 184.5MB. Free memory was 132.5MB in the beginning and 118.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 762009.95ms. Allocated memory was 184.5MB in the beginning and 1.2GB in the end (delta: 983.6MB). Free memory was 117.8MB in the beginning and 858.4MB in the end (delta: -740.5MB). Peak memory consumption was 244.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 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.2s, 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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 [2022-12-06 05:28:34,320 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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 Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 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 - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 52 for 35ms.. - 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 TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 52 for 35ms.. - 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 TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 52 for 35ms.. - 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 TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 52 for 35ms.. - 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: 761.8s, OverallIterations: 1300, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 429.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28892 SdHoareTripleChecker+Valid, 127.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28892 mSDsluCounter, 2659 SdHoareTripleChecker+Invalid, 106.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1336 mSDsCounter, 3907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187551 IncrementalHoareTripleChecker+Invalid, 191458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3907 mSolverCounterUnsat, 1323 mSDtfsCounter, 187551 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7914 GetRequests, 3975 SyntacticMatches, 8 SemanticMatches, 3931 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 24.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1200occurred in iteration=22, InterpolantAutomatonStates: 5225, 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, 8.0s SatisfiabilityAnalysisTime, 71.4s InterpolantComputationTime, 20892 NumberOfCodeBlocks, 20892 NumberOfCodeBlocksAsserted, 1304 NumberOfCheckSat, 19640 ConstructedInterpolants, 0 QuantifiedInterpolants, 79681 SizeOfPredicates, 19 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 1306 InterpolantComputations, 1300 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